On extracting computations from propositional proofs (a survey).

DOI10.4230/LIPIcs.FSTTCS.2010.30zbMath1245.68089OpenAlexW1814032955MaRDI QIDQ2908835

Pavel Pudlák

Publication date: 29 August 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_4da4.html

zbMATH Keywords

resolutionproof complexityBoolean circuitsfeasible interpolationpropositional tautology

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)

Related Items (3)

Dag-like communication and its applications ⋮ A note on monotone real circuits ⋮ Adventures in monotone complexity and TFNP

This page was built for publication: On extracting computations from propositional proofs (a survey).