Algorithms and Computation
From MaRDI portal
(Redirected from Publication:5897895)
Algorithms and Computation (scientific article; zbMATH DE number 5071977)
Algorithms and Computation (scientific article; zbMATH DE number 5071977)
Recommendations
Cited in
(12)- Complexity results for some global optimization problems
- 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
- Experimental complexity analysis of continuous constraint satisfaction problems.
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights
- Graph matching problems and the NP-hardness of sortedness constraints
- The complexity of reasoning with global constraints
- Nonuniform Boolean constraint satisfaction problems with cardinality constraint
- scientific article; zbMATH DE number 5996383 (Why is no real title available?)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
- CSPs with global modular constraints: algorithms and hardness via polynomial representations
- Principles and Practice of Constraint Programming – CP 2004
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems
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)