scientific article; zbMATH DE number 1114028
From MaRDI portal
Publication:4375799
zbMath0901.03033MaRDI QIDQ4375799
Publication date: 1 March 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
lower boundscircuit complexityinterpolation of polynomialsalgebraic models of computationspan programNullstellen refutation
Complexity of computation (including implicit computational complexity) (03D15) Classical propositional logic (03B05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Related Items
On the automatizability of resolution and related propositional proof systems, Nondeterministic functions and the existence of optimal proof systems, From private simultaneous messages to zero-information Arthur-Merlin protocols and back, On the automatizability of polynomial calculus, On arithmetic branching programs, On the computational content of intuitionistic propositional proofs, Mean-payoff games and propositional proofs, A Framework for Space Complexity in Algebraic Proof Systems, Nullstellensatz size-degree trade-offs from reversible pebbling, Proof Complexity of Non-classical Logics, Adventures in monotone complexity and TFNP, No feasible monotone interpolation for simple combinatorial reasoning, Nullstellensatz size-degree trade-offs from reversible pebbling
