scientific article; zbMATH DE number 1775443
From MaRDI portal
zbMath1028.68066MaRDI QIDQ4542575
Publication date: 1 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The complexity of minimal satisfiability problems, Complexity of approximating CSP with balance/hard constraints, Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover, Worst-case study of local search for MAX-\(k\)-SAT., Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs, Robustly Solvable Constraint Satisfaction Problems
