Publication:4542575
From MaRDI portal
zbMath1028.68066MaRDI QIDQ4542575
Publication date: 1 August 2002
68Q25: Analysis of algorithms and problem complexity
Related Items
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs, 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., The complexity of minimal satisfiability problems, Robustly Solvable Constraint Satisfaction Problems