scientific article; zbMATH DE number 515744
From MaRDI portal
Publication:4283247
zbMath0788.68066MaRDI QIDQ4283247
Publication date: 10 March 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (12)
A simplified NP-complete MAXSAT problem ⋮ Efficient 3-SAT algorithms in the tile assembly model ⋮ An approximation algorithm for 3-Colourability ⋮ New methods for 3-SAT decision and worst-case analysis ⋮ Complexity analysis of propositional resolution with autarky pruning ⋮ On \(k\)-positive satisfiability problem ⋮ Number of models and satisfiability of sets of clauses ⋮ On the complexity of \(k\)-SAT ⋮ Improving Efficiency of 3-SAT-Solving Tile Systems ⋮ A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses ⋮ DNA models and algorithms for NP-complete problems ⋮ Which problems have strongly exponential complexity?
This page was built for publication:
