7 citations · 7 across the 6 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CC2022
PPP-Completeness and Extremal Combinatorics
Romain Bourneuf, Lukáš Folwarczný, Pavel Hubáček +2
Many classical theorems in combinatorics establish the emergence of substructures within sufficiently large collections of objects. Well-known examples are Ramsey's theorem on mono…
cs.CC2022
Downward Self-Reducibility in TFNP
Prahladh Harsha, Daniel Mitropolsky, Alon Rosen
A problem is \emph{downward self-reducible} if it can be solved efficiently given an oracle that returns solutions for strictly smaller instances. In the decisional landscape, down…