Pages that link to "Item:Q1881219"

The following pages link to On the automatizability of resolution and related propositional proof systems (Q1881219):

Displaying 12 items.

• Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
• A note on SAT algorithms and proof complexity (Q436581) (← links)
• Mean-payoff games and propositional proofs (Q716324) (← links)
• Exponential separation between Res(\(k\)) and Res(\(k+1\)) for \(k \leqslant \varepsilon\log n\) (Q835026) (← links)
• Resolution for Max-SAT (Q1028942) (← links)
• On the automatizability of polynomial calculus (Q1959382) (← links)
• A combinatorial characterization of resolution width (Q2475405) (← links)
• Automatizability and Simple Stochastic Games (Q3012836) (← links)
• On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (Q3012839) (← links)
• (Q5092398) (← links)
• Finding the Hardest Formulas for Resolution (Q5154766) (← links)
• The Complexity of Propositional Proofs (Q5444711) (← links)