skip to main content

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Thursday, February 13 until 2:00 AM ET on Friday, February 14 due to maintenance. We apologize for the inconvenience.


Title: Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity
Award ID(s):
1942742
PAR ID:
10337265
Author(s) / Creator(s):
; ;
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