Quantified constraints: algorithms and complexity

Quantified constraints: algorithms and complexity

Pokaż inne wersje (1)

Opis bibliograficzny
Główni autorzy:	Börner, F, Bulatov, A, Jeavons, P, Krokhin, A
Format:	Conference item
Wydane:	2003

Podobne zapisy

Quantified constraints: Algorithms and complexity
od: Borner, F, i wsp.
Wydane: (2003)

The complexity of constraint satisfaction games and QCSP
od: Börner, F, i wsp.
Wydane: (2009)

The complexity of maximal constraint languages
od: Bulatov, A, i wsp.
Wydane: (2001)

The complexity of maximal constraint languages
od: Bulatov, A, i wsp.
Wydane: (2001)

The Complexity of Constraint Satisfaction: An Algebraic Approach
od: Krokhin, A, i wsp.
Wydane: (2004)

Classifying the complexity of constraints using finite algebras
od: Bulatov, A, i wsp.
Wydane: (2005)

Classifying the complexity of constraints using finite algebras
od: Bulatov, A, i wsp.
Wydane: (2005)

Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey
od: Krokhin, A, i wsp.
Wydane: (2003)

Functions of multiple−valued logic and the complexity of constraint satisfaction: A short survey
od: Krokhin, A, i wsp.
Wydane: (2003)

The complexity of constraint satisfaction games and QCSP
od: Boerner, F, i wsp.
Wydane: (2009)

Constraint satisfaction problems and finite algebras
od: Bulatov, A, i wsp.
Wydane: (2000)

Constraint satisfaction problems and finite algebras
od: Bulatov, A, i wsp.
Wydane: (2000)

Soft constraints: Complexity and multimorphisms
od: Cohen, D, i wsp.
Wydane: (2003)

Soft constraints: complexity and multimorphsims
od: Cohen, D, i wsp.
Wydane: (2003)

The complexity of soft constraint satisfaction
od: Cohen, D, i wsp.
Wydane: (2006)

The complexity of soft constraint satisfaction
od: Cohen, D, i wsp.
Wydane: (2006)

Constraint satisfaction problems on intervals and lengths
od: Krokhin, A, i wsp.
Wydane: (2004)

Constraint satisfaction problems on intervals and lengths
od: Krokhin, A, i wsp.
Wydane: (2004)

Structural Theory of Automata‚ Semigroups‚ and Universal Algebra
od: Krokhin, A, i wsp.
Wydane: (2003)

An algebraic approach to multi-sorted constraints
od: Bulatov, A, i wsp.
Wydane: (2003)

An algebraic approach to multi−sorted constraints
od: Bulatov, A, i wsp.
Wydane: (2003)

Tractable constraints closed under a binary operation
od: Bulatov, A, i wsp.
Wydane: (2000)

A maximal tractable class of soft constraints
od: Cohen, D, i wsp.
Wydane: (2004)

A maximal tractable class of soft constraints
od: Cohen, D, i wsp.
Wydane: (2004)

Finite semigroups imposing tractable constraints
od: Bulatov, A, i wsp.
Wydane: (2002)

The constraint satisfaction problem: complexity and approximability
od: Krokhin, A, i wsp.
Wydane: (2017)

Binarisation for valued constraint satisfaction problems
od: Cohen, D, i wsp.
Wydane: (2017)

The complexity of constraint languages
od: Cohen, D, i wsp.
Wydane: (2006)

The complexity of valued constraint models
od: Živný, S, i wsp.
Wydane: (2009)

The Complexity of Valued Constraint Models.
od: Zivny, S, i wsp.
Wydane: (2009)

The complexity of valued constraint models
od: Živný, S, i wsp.
Wydane: (2009)

A complete classification of complexity in Allen's algebra in the presence of a non−trivial basic relation
od: Krokhin, A, i wsp.
Wydane: (2001)

Supermodular Functions and the Complexity of MAX CSP
od: Cohen, D, i wsp.
Wydane: (2004)

Supermodular functions and the complexity of MAX CSP
od: Cohen, D, i wsp.
Wydane: (2005)

Supermodular functions and the complexity of M-AX CSP
od: Cohen, D, i wsp.
Wydane: (2005)

Chapter 8 The complexity of constraint languages
od: Cohen, D, i wsp.
Wydane: (2006)

The complexity of global cardinality constraints
od: Andrei A. Bulatov, i wsp.
Wydane: (2010-10-01)

An algebraic characterisation of complexity for valued constraints
od: Cohen, D, i wsp.
Wydane: (2006)

An algebraic characterisation of complexity for valued constraints
od: Cohen, D, i wsp.
Wydane: (2006)

Supermodularity on chains and complexity of maximum constraint satisfaction
od: Vladimir Deineko, i wsp.
Wydane: (2005-01-01)