Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > CHRISTOPHE MARCIOT:
All reports by Author Christophe Marciot:

TR25-069 | 30th May 2025
Noah Fleming, Christophe Marciot, Deniz imrek

Provably Total Functions in the Polynomial Hierarchy

TFNP studies the complexity of total, verifiable search problems, and represents the first layer of the total function polynomial hierarchy (TFPH). Recently, problems in higher levels of the TFPH have gained significant attention, partly due to their close connection to circuit lower bounds. However, very little is known about the ... more >>>




ISSN 1433-8092 | Imprint