The following pages link to (Q4283247):
Displaying 11 items.
- A simplified NP-complete MAXSAT problem (Q293164) (← links)
- Number of models and satisfiability of sets of clauses (Q672138) (← links)
- A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses (Q1275602) (← links)
- DNA models and algorithms for NP-complete problems (Q1276167) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- Complexity analysis of propositional resolution with autarky pruning (Q1961454) (← links)
- On \(k\)-positive satisfiability problem (Q1964360) (← links)
- Efficient 3-SAT algorithms in the tile assembly model (Q2629931) (← links)
- Improving Efficiency of 3-SAT-Solving Tile Systems (Q3070958) (← links)
- On the complexity of \(k\)-SAT (Q5943094) (← links)
