The following pages link to (Q4542576):
Displaying 18 items.
- Random CNF's are hard for the polynomial calculus (Q626686) (← links)
- An improved generator for 3-CNF formulas (Q827897) (← links)
- On the limit of branching rules for hard random unsatisfiable 3-SAT (Q1408384) (← links)
- Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT (Q1777400) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- A sharp threshold in proof complexity yields lower bounds for satisfiability search (Q1887710) (← links)
- On unique satisfiability and the threshold behavior of randomized reductions (Q1894445) (← links)
- Many hard examples in exact phase transitions (Q2368999) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- The structure of the set of satisfying assignments for a random \(k\)-CNF (Q2519391) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- (Q3002778) (← links)
- Strong Refutation Heuristics for Random k-SAT (Q3429738) (← links)
- An efficient local search method for random 3-satisfiability (Q3439117) (← links)
- An Upper Bound on the Space Complexity of Random Formulae in Resolution (Q4405552) (← links)
- An Introduction to Lower Bounds on Resolution Proof Systems (Q5135261) (← links)
- On ε‐biased generators in NC<sup>0</sup> (Q5486308) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
