Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity
- Award ID(s):
- 1942742
- PAR ID:
- 10337265
- Date Published:
- Journal Name:
- computational complexity
- Volume:
- 30
- Issue:
- 2
- ISSN:
- 1016-3328
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found