Tractability frontiers of the partner units configuration problem

DOI10.1016/j.jcss.2015.12.004zbMath1338.68045OpenAlexW2310736451WikidataQ59259463 ScholiaQ59259463MaRDI QIDQ269477

Erich Christian Teppan, Gerhard Friedrich, Georg Gottlob

Publication date: 18 April 2016

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2015.12.004

zbMATH Keywords

computational complexityNP-completenesspartner units problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17)

Related Items (2)

Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems ⋮ On the complexity of the partner units decision problem

Cites Work

• Unnamed Item
• Optimization Methods for the Partner Units Problem
• The DLV system for knowledge representation and reasoning

This page was built for publication: Tractability frontiers of the partner units configuration problem