Pages that link to "Item:Q1885907"

The following pages link to On the complexity of resolution with bounded conjunctions (Q1885907):

Displaying 10 items.

• The depth of resolution proofs (Q647405) (← links)
• A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games (Q1675824) (← links)
• The treewidth of proofs (Q2013559) (← links)
• A Framework for Space Complexity in Algebraic Proof Systems (Q2796410) (← links)
• Total Space in Resolution (Q2829448) (← links)
• On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (Q3012839) (← links)
• Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
• The Complexity of Propositional Proofs (Q5444711) (← links)
• Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)
• Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)