DeepAI AI Chat
Log In Sign Up

Extremal combinatorics, iterated pigeonhole arguments, and generalizations of PPP

by   Amol Pasarkar, et al.

We study the complexity of computational problems arising from existence theorems in extremal combinatorics. For some of these problems, a solution is guaranteed to exist based on an iterated application of the Pigeonhole Principle. This results in the definition of a new complexity class within TFNP, which we call PLC (for "polynomial long choice"). PLC includes all of PPP, as well as numerous previously unclassified total problems, including search problems related to Ramsey's theorem, the Sunflower theorem, the Erdős-Ko-Rado lemma, and König's lemma. Whether the first two of these four problems are PLC-complete is an important open question which we pursue; in contrast, we show that the latter two are PPP-complete. Finally, we reframe PPP as an optimization problem, and define a hierarchy of such problems related to Turán's theorem.


page 1

page 2

page 3

page 4


On the Complexity of Modulo-q Arguments and the Chevalley-Warning Theorem

We study the search problem class PPA_q defined as a modulo-q analog of ...

On Search Complexity of Discrete Logarithm

In this work, we study the discrete logarithm problem in the context of ...

PPP-Completeness and Extremal Combinatorics

Many classical theorems in combinatorics establish the emergence of subs...

A Local Perspective on the Polynomial Hierarchy

We extend classical methods of computational complexity to the setting o...

The Complexity of Tiling Problems

In this document, we collected the most important complexity results of ...