Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-32275-7_19
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Constraint Satisfaction for Planning and Scheduling Problems

Constraints
CombinatoricsMathematicsDiscrete MathematicsComputational TheoryArtificial IntelligenceSoftware
2011English

Robustness and Stability in Dynamic Constraint Satisfaction Problems

English

The Approximability of Constraint Satisfaction Problems

SIAM Journal on Computing
MathematicsComputer Science
2001English

Constraint Satisfaction Problems With Infinite Templates

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Constraint Satisfaction Problems Over the Integers With Successor

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

The Resolution Complexity of Random Constraint Satisfaction Problems

SIAM Journal on Computing
MathematicsComputer Science
2007English

Solving Partial Constraint Satisfaction Problems With Tree Decomposition

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2002English

Sticky Brownian Rounding and Its Applications to Constraint Satisfaction Problems

2020English

Replaceability for Constraint Satisfaction Problems: Algorithms, Inference, and Complexity Patterns

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy