The Resolution Complexity of Random Constraint Satisfaction Problems

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

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

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

English

Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems

Linköping Studies in Science and Technology. Dissertations
2020English

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

Sharp Thresholds for a Random Constraint Satisfaction Problem

Open Journal of Applied Sciences
2017English

Constraint Satisfaction for Planning and Scheduling Problems

Constraints
CombinatoricsMathematicsDiscrete MathematicsComputational TheoryArtificial IntelligenceSoftware
2011English

The Complexity of Satisfaction Problems in Reverse Mathematics

Computability
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsArtificial IntelligenceMathematics
2015English

Robustness and Stability in Dynamic Constraint Satisfaction Problems

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy