PPP-Completeness and Extremal Combinatorics

by   Romain Bourneuf, et al.

Many classical theorems in combinatorics establish the emergence of substructures within sufficiently large collections of objects. Well-known examples are Ramsey's theorem on monochromatic subgraphs and the Erdős-Rado sunflower lemma. Implicit versions of the corresponding total search problems are known to be PWPP-hard; here "implici" means that the collection is represented by a poly-sized circuit inducing an exponentially large number of objects. We show that several other well-known theorems from extremal combinatorics - including Erdős-Ko-Rado, Sperner, and Cayley's formula - give rise to complete problems for PWPP and PPP. This is in contrast to the Ramsey and Erdős-Rado problems, for which establishing inclusion in PWPP has remained elusive. Besides significantly expanding the set of problems that are complete for PWPP and PPP, our work identifies some key properties of combinatorial proofs of existence that can give rise to completeness for these classes. Our completeness results rely on efficient encodings for which finding collisions allows extracting the desired substructure. These encodings are made possible by the tightness of the bounds for the problems at hand (tighter than what is known for Ramsey's theorem and the sunflower lemma). Previous techniques for proving bounds in TFNP invariably made use of structured algorithms. Such algorithms are not known to exist for the theorems considered in this work, as their proofs "from the book" are non-constructive.


page 1

page 2

page 3

page 4


Four proofs of the directed Brooks' Theorem

We give four new proofs of the directed version of Brook's Theorem and a...

Extremal combinatorics, iterated pigeonhole arguments, and generalizations of PPP

We study the complexity of computational problems arising from existence...

Finding Proofs in Tarskian Geometry

We report on a project to use a theorem prover to find proofs of the the...

Consistency of circuit lower bounds with bounded theories

Proving that there are problems in P^NP that require boolean circuits of...

Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory (Extended Version)

We study various formulations of the completeness of first-order logic p...

Geometrical tilings : distance, topology, compactness and completeness

We present the different distances on tilings of Rd that exist in the li...

d-Separation: From Theorems to Algorithms

An efficient algorithm is developed that identifies all independencies i...

Please sign up or login with your details

Forgot password? Click here to reset