Algorithms and Computation

DOI10.1007/11602613MaRDI QIDQ5897895zbMATH OpenOpenAlexFDO

Authors Cristina Bazgan, Marek Karpinski

Publication date 14 November 2006

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

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of global cardinality constraints
• Constraint satisfaction -- algorithms and complexity analysis
• The complexity of reasoning with global constraints
• Principles and Practice of Constraint Programming – CP 2004
• Computational Complexity of Constraint Satisfaction

Cited in

(11)

• Nonuniform Boolean constraint satisfaction problems with cardinality constraint
• Global optimization and constraint satisfaction. First international workshop on global constraint optimization and constraint satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2--4, 2002. Revised selected papers
• Graph matching problems and the NP-hardness of sortedness constraints
• Experimental complexity analysis of continuous constraint satisfaction problems.
• A bounded-error quantum polynomial-time algorithm for two graph bisection problems
• CSPs with global modular constraints: algorithms and hardness via polynomial representations
• The complexity of reasoning with global constraints
• scientific article; zbMATH DE number 5996383 (Why is no real title available?)
• Complexity results for some global optimization problems
• Principles and Practice of Constraint Programming – CP 2004
• Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint

This page was built for publication: Algorithms and Computation

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