Colourful TFNP and propositional proofs

DOI10.4230/LIPICS.CCC.2023.36MaRDI QIDQ6640374zbMATH OpenFDO

Authors Ben Davis, Robert Robere

Publication date 19 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CCC.2023.36

zbMATH Keywords

lower boundsoracle separationsproof complexityres(k)TFNP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(5)

• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
• From proof complexity to circuit complexity via interactive protocols
• Intersection classes in TFNP and proof complexity
• TFNP intersections through the Lens of feasible disjunction
• Towards PNP from extended Frege lower bounds

This page was built for publication: Colourful TFNP and propositional proofs

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