Pages that link to "Item:Q5175988"
From MaRDI portal
The following pages link to A sharp threshold in proof complexity (Q5175988):
Displayed 10 items.
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103) (← links)
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas (Q862399) (← links)
- On the relation among answer set solvers (Q1028643) (← 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)
- Hard satisfiable instances for DPLL-type algorithms (Q2577593) (← links)
- The state of SAT (Q2643296) (← links)
- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (Q3502697) (← links)
- Cores in random hypergraphs and Boolean formulas (Q5311914) (← links)
- The satisfiability threshold for randomly generated binary constraint satisfaction problems (Q5471050) (← links)
- The probabilistic analysis of a greedy satisfiability algorithm (Q5486323) (← links)