Sticky Brownian Rounding and Its Applications to Constraint Satisfaction Problems

doi 10.1137/1.9781611975994.52
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Constraint Satisfaction for Planning and Scheduling Problems

Constraints
CombinatoricsMathematicsDiscrete MathematicsComputational TheoryArtificial IntelligenceSoftware
2011English

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

Robustness and Stability in Dynamic Constraint Satisfaction Problems

English

Dynamic Flexible Constraint Satisfaction and Its Application to AI Planning

2004English

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

Distributed Constraint Optimization Problems and Applications: A Survey

Journal of Artificial Intelligence Research
Artificial Intelligence
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy