scientific article; zbMATH DE number 1114017

zbMath0890.03029MaRDI QIDQ4375786

Samuel R. Buss

Publication date: 24 June 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

propositional logicdesignsNullstellensatz proof systemalgebraic identities in fieldshousesitting principleNullstellensatz lower bounds

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Other designs, configurations (05B30) Classical propositional logic (03B05) Complexity of proofs (03F20)

Related Items (7)

Limitations of Algebraic Approaches to Graph Isomorphism Testing ⋮ Lov\'asz Meets Weisfeiler and Leman ⋮ A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝 Frege systems] ⋮ Propositional proofs and reductions between NP search problems ⋮ Linear gaps between degrees for the polynomial calculus modulo distinct primes ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling

This page was built for publication: