On the complexity of the partner units decision problem

DOI10.1016/J.ARTINT.2017.04.002MaRDI QIDQ2407462zbMATH OpenOpenAlexFDO

Authors Erich Christian Teppan

Publication date 29 September 2017

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2017.04.002

zbMATH Keywords

computational complexityNP-completenesspartner units problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Tractability frontiers of the partner units configuration problem
• Optimization Methods for the Partner Units Problem
• Fixed-parameter complexity of semantics for logic programs
• On the complexity of some partition problems
• scientific article; zbMATH DE number 1538017

Cites work

• A simplified NP-complete satisfiability problem
• Design and results of the Fifth Answer Set Programming Competition
• scientific article; zbMATH DE number 4187147 (Why is no real title available?)
• Optimization Methods for the Partner Units Problem
• Reducibility among combinatorial problems
• Tractability frontiers of the partner units configuration problem

Cited in

(4)

• Tractability frontiers of the partner units configuration problem
• Optimization Methods for the Partner Units Problem
• Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
• Adaptive large-neighbourhood search for optimisation in answer-set programming

This page was built for publication: On the complexity of the partner units decision problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407462)