scientific article; zbMATH DE number 956856
From MaRDI portal
Publication:5687264
zbMath0864.90089MaRDI QIDQ5687264
Yuichi Asahiro, Kazuo Iwama, Eiji Miyano
Publication date: 11 December 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parallel algorithms in computer science (68W10) Boolean programming (90C09) Discrete mathematics in relation to computer science (68R99)
Related Items (9)
Complexity of finding dense subgraphs ⋮ Generating new test instances by evolving in instance space ⋮ A competitive and cooperative approach to propositional satisfiability ⋮ Better approximations of non-Hamiltonian graphs ⋮ Approximation of coNP sets by NP-complete sets ⋮ Generation techniques for linear programming instances with controllable properties ⋮ UnitWalk: A new SAT solver that uses local search guided by unit clause elimination ⋮ A complete adaptive algorithm for propositional satisfiability ⋮ On conversions from CNF to ANF
This page was built for publication:
