White-box vs. black-box complexity of search problems: Ramsey and graph property testing

Ilan Komargodski*, Moni Naor, Eylon Yogev

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

21 Scopus citations

Fingerprint

Dive into the research topics of 'White-box vs. black-box complexity of search problems: Ramsey and graph property testing'. Together they form a unique fingerprint.

Keyphrases

Mathematics

Computer Science