TFNP characterizations of proof systems and monotone circuits

DOI10.4230/LIPICS.ITCS.2023.30MaRDI QIDQ6610293zbMATH OpenFDO

Authors Samuel R. Buss, Noah Fleming, Russell Impagliazzo

Publication date 25 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2023.30

zbMATH Keywords

circuit complexityproof complexityTFNP

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• Intersection classes in TFNP and proof complexity

This page was built for publication: TFNP characterizations of proof systems and monotone circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6610293)