The following pages link to (Q5687266):
Displaying 50 items.
- SAT race 2015 (Q334795) (← links)
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- A dual algorithm for the satisfiability problem (Q750165) (← links)
- Computational experience with an interior point algorithm on the satisfiability problem (Q753688) (← links)
- On market-inspired approaches to propositional satisfiability (Q814434) (← links)
- Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings (Q862408) (← links)
- An efficient approach to solving random \(k\)-SAT problems (Q877837) (← links)
- Nonserial dynamic programming formulations of satisfiability (Q1099093) (← links)
- Solving the satisfiability problem by using randomized approach (Q1190510) (← links)
- Experimental study on strategy of combining SAT algorithms (Q1273082) (← links)
- How good are branching rules in DPLL? (Q1281405) (← links)
- Length of prime implicants and number of solutions of random CNF formulae (Q1285568) (← links)
- A two-phase algorithm for solving a class of hard satisfiability problems (Q1306378) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- Nonsystematic search and no-good learning (Q1581850) (← links)
- Quasiphysical and quasisociological algorithm Solar for solving SAT problem (Q1610034) (← links)
- An algorithm based on tabu search for satisfiability problem (Q1613279) (← 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)
- Partitioning methods for satisfiability testing on large formulas (Q1854377) (← links)
- The \(Multi\)-SAT algorithm (Q1961449) (← links)
- Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)
- Solving SAT by algorithm transform of Wu's method (Q1966110) (← links)
- On the complexity of choosing the branching literal in DPLL (Q1978252) (← links)
- The possibilistic Horn non-clausal knowledge bases (Q2105624) (← links)
- Visualizing SAT instances and runs of the DPLL algorithm (Q2462641) (← links)
- Solving SAT problem by heuristic polarity decision-making algorithm (Q2465749) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- The state of SAT (Q2643296) (← 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)
- Efficient solution of MAX-SAT and SAT via higher order Boltzmann machines (Q2726419) (← links)
- Exploiting the real power of unit propagation lookahead (Q2741514) (← links)
- SatEx: A web-based framework for SAT experimentation (Q2741519) (← links)
- The unreasonable effectiveness of alternation-based satisfiabiity algorithms (Q2741530) (← links)
- Ensemble-based prediction of SAT search behaviour (Q2741532) (← links)
- Solving satisfiability using decomposition and the most constrained subproblem (Q2741535) (← links)
- An exact and a randomized approach for the satisfiability problem (Q2747196) (← links)
- SATLIB: An online resource for research on SAT (Q2749862) (← links)
- Satisfiability by Maxwell-Boltzmann and Bose-Einstein statistical distributions (Q2828180) (← links)
- Satsisfiability and Systematicity (Q2941741) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Between SAT and UNSAT: The Fundamental Difference in CDCL SAT (Q3453235) (← links)
- Experimental comparison of 2-satisfiability algorithms (Q3979516) (← links)
- Une famille d'algorithmes polynomiaux pour la résolution de classes d'instances du problème SAT. (A family of polynomial algorithms for the solution of classes of instances of the SAT problem) (Q3985743) (← links)
- A simple test improves checking satisfiability (Q4036283) (← links)
