scientific article; zbMATH DE number 1467488
From MaRDI portal
zbMath0947.68044MaRDI QIDQ4488090
No author found.
Publication date: 25 July 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An efficient approach to solving random \(k\)-SAT problems, How to fake an RSA signature by encoding modular root finding as a SAT problem, Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets, SAT problems with chains of dependent variables, Computational complexity of auditing finite attributes in statistical databases, Visualizing SAT instances and runs of the DPLL algorithm, Recognizing frozen variables in constraint satisfaction problems, Problem difficulty for tabu search in job-shop scheduling, On market-inspired approaches to propositional satisfiability
