skip to main content

Attention:

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

Explore Research Products in the NSF-PAR

Title: A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
Award ID(s):
1947546
NSF-PAR ID:
10384264
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Discrete Applied Mathematics
Volume:
322
Issue:
C
ISSN:
0166-218X
Page Range / eLocation ID:
117 to 122
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email