The Approximability of Constraint Satisfaction Problems

SIAM Journal on Computing - United States
doi 10.1137/s0097539799349948
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

The Resolution Complexity of Random Constraint Satisfaction Problems

SIAM Journal on Computing
MathematicsComputer Science
2007English

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

Constraint Satisfaction for Planning and Scheduling Problems

Constraints
CombinatoricsMathematicsDiscrete MathematicsComputational TheoryArtificial IntelligenceSoftware
2011English

Robustness and Stability in Dynamic Constraint Satisfaction Problems

English

Solving Partial Constraint Satisfaction Problems With Tree Decomposition

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2002English

Decidable Relationships Between Consistency Notions for Constraint Satisfaction Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Sticky Brownian Rounding and Its Applications to Constraint Satisfaction Problems

2020English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy