Publication:4411838
From MaRDI portal
zbMath1020.68039MaRDI QIDQ4411838
Heribert Vollmer, Edith Hemaspaandra, Elmar Böhler, Steffen Reith
Publication date: 10 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2471/24710412.htm
68Q25: Analysis of algorithms and problem complexity
90C27: Combinatorial optimization
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?, Partial Polymorphisms and Constraint Satisfaction Problems, The complexity of equivalence and isomorphism of systems of equations over finite groups, Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint