The following pages link to (Q3145805):
Displaying 8 items.
- On complete one-way functions (Q734307) (← links)
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (Q937398) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae (Q2741521) (← links)
- Practical Implementation of a Quantum Backtracking Algorithm (Q3297790) (← links)