The following pages link to The probability of pure literals (Q4700097):
Displaying 6 items.
- The complexity of pure literal elimination (Q862401) (← links)
- An efficient approach to solving random \(k\)-SAT problems (Q877837) (← links)
- Pruning processes and a new characterization of convex geometries (Q1025925) (← links)
- An exponential lower bound for the pure literal rule (Q1104093) (← links)
- On the occurence of null clauses in random instances of Satisfiability (Q1208481) (← links)
- The expected complexity of analytic tableaux analyses in propositional calculus. II (Q1353995) (← links)