SOFSEM 2004: Theory and Practice of Computer Science

DOI10.1007/B95046MaRDI QIDQ5902002zbMATH OpenOpenAlexFDO

Authors George Boukeas, Constantinos Halatsis, V. Zissimopoulos, Panagiotis Stamatopoulos

Publication date 4 June 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b95046

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Methods and Applications of Artificial Intelligence
• From backdoor key to backdoor completability: improving a known measure of hardness for the satisfiable CSP
• scientific article; zbMATH DE number 1113991
• scientific article; zbMATH DE number 7301529
• Refining the phase transition in combinatorial search

Cited in

(4)

• From backdoor key to backdoor completability: improving a known measure of hardness for the satisfiable CSP
• Methods and Applications of Artificial Intelligence
• Measuring instance difficulty for combinatorial optimization problems
• An algebraic hardness criterion for surjective constraint satisfaction.

This page was built for publication: SOFSEM 2004: Theory and Practice of Computer Science

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