Results 21 to 30 of about 34 (34)

A Simple Algorithm for Mal'tsev Constraints

SIAM Journal on Computing, 2006
Andrei Bulatov, Víctor Dalmau
exaly  

The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)

SIAM Journal on Computing, 2009
Marcin Kozik, Libor Barto, Todd Niven
exaly  

An Algebraic Theory of Complexity for Discrete Optimization

SIAM Journal on Computing, 2013
Stanislav Živný, Peter G. Jeavons, Martin C. Cooper   +2 more
exaly  

Binarisation for Valued Constraint Satisfaction Problems

SIAM Journal on Discrete Mathematics, 2017
Stanislav Živný, Peter G. Jeavons
exaly  

Tractability and Learnability Arising from Algebras with Few Subpowers

SIAM Journal on Computing, 2010
Matthew Anthony Valeriote, Ross David Willard, Petar Marković   +2 more
exaly  

MAX ONES Generalized to Larger Domains

SIAM Journal on Computing, 2008
Peter Jonsson, Gustav Nordh
exaly  

On multivarieties and multialgebraic categories

Journal of Pure and Applied Algebra, 2001
Jiří Rosický
exaly  

The Power of Linear Programming for General-Valued CSPs

SIAM Journal on Computing, 2015
Stanislav Živný, Vladimir Kolmogorov, Johan Thapper   +2 more
exaly  

Necessary Conditions for Tractability of Valued CSPs

SIAM Journal on Discrete Mathematics, 2015
Stanislav Živný, Johan Thapper
exaly  

The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case

SIAM Journal on Computing, 2008
Hubie Chen
exaly