White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing

Electronic Colloquium on Computational Complexity (ECCC), Volume 66, Issue 5, 2019, Pages 1-28.

Cited by: 27|Bibtex|Views38|Links
EI
Keywords:
Ramsey theoryblack-box hardnesswhite-box hardness

Abstract:

Ramsey theory assures us that in any graph there is a clique or independent set of a certain size, roughly logarithmic in the graph size. But how difficult is it to find the clique or independent set? If the graph is given explicitly, then it is possible to do so while examining a linear number of edges. If the graph is given by a black-b...More

Code:

Data:

Your rating :
0

 

Tags
Comments