Pages that link to "Item:Q3149864"
From MaRDI portal
The following pages link to Space Complexity in Propositional Calculus (Q3149864):
Displayed 44 items.
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- Algebraic proofs over noncommutative formulas (Q642520) (← links)
- The depth of resolution proofs (Q647405) (← links)
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- A simplified way of proving trade-off results for resolution (Q989569) (← links)
- A combinatorial characterization of treelike resolution space (Q1014444) (← links)
- Verifying time, memory and communication bounds in systems of reasoning agents (Q1036066) (← links)
- On space and depth in resolution (Q1616620) (← links)
- A note about \(k\)-DNF resolution (Q1641156) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- On semantic cutting planes with very small coefficients (Q1751424) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Space proof complexity for random 3-CNFs (Q2013560) (← links)
- Reversible pebble games and the relation between tree-like and general resolution space (Q2033469) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Another look at degree lower bounds for polynomial calculus (Q2333803) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- A Framework for Space Complexity in Algebraic Proof Systems (Q2796410) (← links)
- Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space (Q2817796) (← links)
- Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers (Q2818010) (← links)
- A Tutorial on Time and Space Bounds in Tree-Like Resolution (Q2821700) (← links)
- Total Space in Resolution (Q2829448) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (Q3012839) (← links)
- (Q3304105) (← links)
- Bounded-Resource Reasoning as (Strong or Classical) Planning (Q3393381) (← links)
- An Upper Bound on the Space Complexity of Random Formulae in Resolution (Q4405552) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- (Q4625701) (← links)
- (Q4625702) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
- (Q5092479) (← links)
- An Introduction to Lower Bounds on Resolution Proof Systems (Q5135261) (← links)
- Supercritical Space-Width Trade-offs for Resolution (Q5215515) (← links)
- From Small Space to Small Width in Resolution (Q5277893) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas (Q6116360) (← links)
- Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)