scientific article; zbMATH DE number 1559517
From MaRDI portal
Publication:4526965
zbMath0962.68068MaRDI QIDQ4526965
Madhu Sudan, David P. Williamson, Sanjeev Khanna
Publication date: 28 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Unnamed Item ⋮ Complexity and approximability of parameterized MAX-CSPs ⋮ Independent sets with domination constraints ⋮ Optimal satisfiability for propositional calculi and constraint satisfaction problems. ⋮ Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight ⋮ The Weight in Enumeration ⋮ Complexity Classification of Local Hamiltonian Problems ⋮ Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights ⋮ Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? ⋮ Structural properties of bounded relations with an application to NP optimization problems ⋮ Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems ⋮ On the Hamming distance of constraint satisfaction problems. ⋮ Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
This page was built for publication:
