Pages that link to "Item:Q2819584"

The following pages link to Short proofs are narrow -- resolution made simple (Q2819584):

Displaying 27 items.

• A dichotomy for local small-bias generators (Q315550) (← links)
• Lifting lower bounds for tree-like proofs (Q475337) (← links)
• The intractability of resolution (Q1071750) (← links)
• Davis-Putnam resolution versus unrestricted resolution (Q1353991) (← links)
• Resolution and binary decision diagrams cannot simulate each other polynomially (Q1408378) (← links)
• Relative efficiency of propositional proof systems: Resolution vs. cut-free LK (Q1577476) (← links)
• A complexity gap for tree resolution (Q1601038) (← links)
• Relating size and width in variants of Q-resolution (Q1653019) (← links)
• The complexity of proving that a graph is Ramsey (Q1705815) (← links)
• Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
• Space bounds for resolution (Q1854472) (← links)
• On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
• Mutilated chessboard problem is exponentially hard for resolution (Q1884991) (← links)
• On a generalization of extended resolution (Q1961452) (← links)
• Andrews Skolemization may shorten resolution proofs non-elementarily (Q2151391) (← links)
• Width versus size in resolution proofs (Q2382288) (← links)
• The complexity of properly learning simple concept classes (Q2462500) (← links)
• An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (Q2980924) (← links)
• Cutting Planes and the Parameter Cutwidth (Q3576046) (← links)
• Space complexity of random formulae in resolution (Q4417005) (← links)
• Are Short Proofs Narrow? QBF Resolution is not Simple. (Q4601867) (← links)
• Are Short Proofs Narrow? QBF Resolution Is <i>Not</i> So Simple (Q4608723) (← links)
• Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
• (Q5146113) (← links)
• Theory and Applications of Satisfiability Testing (Q5713719) (← links)
• Theory and Applications of Satisfiability Testing (Q5713749) (← links)
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (Q5902141) (← links)