The following pages link to (Q5687266):
Displayed 24 items.
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- An efficient approach to solving random \(k\)-SAT problems (Q877837) (← links)
- How good are branching rules in DPLL? (Q1281405) (← links)
- Length of prime implicants and number of solutions of random CNF formulae (Q1285568) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← 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 complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- On the relations between SAT and CSP enumerative algorithms (Q1841881) (← links)
- Solving satisfiability problems using elliptic approximations -- effective branching rules (Q1841892) (← links)
- Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)
- On the complexity of choosing the branching literal in DPLL (Q1978252) (← links)
- The possibilistic Horn non-clausal knowledge bases (Q2105624) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- BerkMin: A fast and robust SAT-solver (Q2643301) (← links)
- Experimental results on the crossover point in random 3-SAT (Q2674177) (← links)
- The satisfiability constraint gap (Q2674178) (← links)
- (Q2741514) (← links)
- (Q2741519) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Between SAT and UNSAT: The Fundamental Difference in CDCL SAT (Q3453235) (← links)
- SATO: An efficient propositional prover (Q5234711) (← links)
- Upper bounds on the satisfiability threshold (Q5958807) (← links)
- A first polynomial non-clausal class in many-valued logic (Q6083144) (← links)