#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1989

2019

- This year (8)
- Last 5 years (27)
- Last 10 years (57)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin
- SIAM J. Comput.
- 2005

Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the… (More)

- Andrei A. Bulatov
- 18th Annual IEEE Symposium of Logic in Computer…
- 2003

In a constraint satisfaction problem (CSP), the aim is to find an assignment of values to a given set of variables, subject to specified constraints. The CSP is known to be NP-complete in general.… (More)

- Andrei A. Bulatov
- J. ACM
- 2006

The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on a possible form of… (More)

- Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons
- ICALP
- 2000

The purpose of the workshop was to bring together researchers from the computational complexity, logic, and universal algebra communities in order to advance the understanding of the constraint… (More)

- Andrei A. Bulatov, Martin Grohe
- ICALP
- 2004

- Andrei A. Bulatov
- ICALP
- 2008

- Andrei A. Bulatov
- The 43rd Annual IEEE Symposium on Foundations of…
- 2002

The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on the possible form… (More)

- Andrei A. Bulatov, Víctor Dalmau
- SIAM J. Comput.
- 2006

A Mal’tsev operation is a ternary operation φ that satisfies the identities φ(x, y, y) = φ(y, y, x) = x. Constraint satisfaction problems involving constraints invariant under a Mal’tsev operation… (More)

- Albert Atserias, Andrei A. Bulatov, Víctor Dalmau
- ICALP
- 2007

The k-consistency algorithm for constraint-satisfaction problems proceeds, roughly, by finding all partial solutions on at most k variables and iteratively deleting those that cannot be extended to a… (More)

- Andrei A. Bulatov
- IEEE 58th Annual Symposium on Foundations of…
- 2017

In a non-uniform Constraint Satisfaction problem CSP(Γ), where G is a set of relations on a finite set A, the goal is to find an assignment of values to variables subject to constraints… (More)