| Title: |
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Ilan Komargodski |
-
Weizmann Institute of Science, Department of Computer Science and Applied Mathematics
|
| Moni Naor |
-
Weizmann Institute of Science, Department of Computer Science and Applied Mathematics
|
| Eylon Yogev |
-
Weizmann Institute of Science, Department of Computer Science and Applied Mathematics
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
|
| DBLP Key: |
conf/focs/KomargodskiNY17
|
| Author Comments: |
|