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

**Ilan Komargodski**

**Monday, April 9th, 2018**

**4:00pm 114 Gates**

**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? This problem is in TFNP, the class of search problems with guaranteed solutions. 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-box, where to figure out whether a certain edge exists the box should be queried, then a large number of queries must be issued.

1) What if one is given a program or circuit ("white-box") for computing the existence of an edge. Does the search problem remain hard?

2) Can we generically translate all TFNP black-box hardness into white-box hardness?

3) Does the problem remain hard if the black-box instance is small?

We will answer all of these questions and discuss related questions in the setting of property testing.

Joint work with Moni Naor and Eylon Yogev.

.