Publication:4375786
From MaRDI portal
zbMath0890.03029MaRDI QIDQ4375786
Publication date: 24 June 1998
propositional logic; designs; Nullstellensatz proof system; algebraic identities in fields; housesitting principle; Nullstellensatz lower bounds
68W30: Symbolic computation and algebraic computation
05B30: Other designs, configurations
03B05: Classical propositional logic
03F20: Complexity of proofs
Related Items
Nullstellensatz size-degree trade-offs from reversible pebbling, Lov\'asz Meets Weisfeiler and Leman, Linear gaps between degrees for the polynomial calculus modulo distinct primes, Propositional proofs and reductions between NP search problems, Nullstellensatz size-degree trade-offs from reversible pebbling, A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝 Frege systems], Limitations of Algebraic Approaches to Graph Isomorphism Testing