scientific article; zbMATH DE number 1114017
From MaRDI portal
Publication:4375786
Recommendations
Cited in
(19)- Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs
- Lov\'asz Meets Weisfeiler and Leman
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems
- Limitations of algebraic approaches to graph isomorphism testing
- Separations in proof complexity and TFNP
- Linear gaps between degrees for the polynomial calculus modulo distinct primes
- Propositional proofs and reductions between NP search problems
- Design Strategies for ARX with Provable Bounds: Sparx and LAX
- On some \(\boldsymbol{\Sigma}^B_0\)-formulae generalizing counting principles over \(V^0\)
- Strength and limitations of Sherali-Adams and nullstellensatz proof systems
- Nullstellensatz size-degree trade-offs from reversible pebbling
- Extended Nullstellensatz proof systems
- Nullstellensatz size-degree trade-offs from reversible pebbling
- Zero-One Designs Produce Small Hard SAT Instances
- Bounds on the total coefficient size of nullstellensatz proofs of the pigeonhole principle
- On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
- Intersection classes in TFNP and proof complexity
- TFNP intersections through the Lens of feasible disjunction
- A simple supercritical tradeoff between size and height in resolution
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375786)
