Pages that link to "Item:Q2819584"
From MaRDI portal
The following pages link to Short proofs are narrow—resolution made simple (Q2819584):
Displaying 15 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)
- 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)
- The complexity of proving that a graph is Ramsey (Q1705815) (← links)
- Space bounds for resolution (Q1854472) (← links)
- Mutilated chessboard problem is exponentially hard for resolution (Q1884991) (← 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)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- (Q5146113) (← links)
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (Q5902141) (← links)
