# Andrei A. Krokhin

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Classifying the Complexity of Constraints Using Finite Algebras

- A. A. Bulatov, Peter Jeavons, Andrei A. Krokhin
- Computer Science, Mathematics
- SIAM J. Comput.
- 1 March 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… Expand

The complexity of soft constraint satisfaction

- D. Cohen, M. Cooper, Peter Jeavons, Andrei A. Krokhin
- Mathematics, Computer Science
- Artif. Intell.
- 1 August 2006

Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint types. One very powerful… Expand

Constraint Satisfaction Problems and Finite Algebras

- A. A. Bulatov, Andrei A. Krokhin, Peter Jeavons
- Mathematics, Computer Science
- ICALP
- 9 July 2000

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… Expand

Quantified Constraints: Algorithms and Complexity

- F. Börner, A. A. Bulatov, Peter Jeavons, Andrei A. Krokhin
- Computer Science
- CSL
- 25 August 2003

The standard constraint satisfaction problem over an arbitrary finite domain can be expressed as follows: given a first-order sentence consisting of a conjunction of predicates, where all of the… Expand

Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra

- Andrei A. Krokhin, Peter Jeavons, P. Jonsson
- Computer Science, Mathematics
- JACM
- 1 September 2003

Allen's interval algebra is one of the best established formalisms for temporal reasoning. This article provides the final step in the classification of complexity for satisfiability problems over… Expand

The complexity of maximal constraint languages

- A. A. Bulatov, Andrei A. Krokhin, Peter Jeavons
- Computer Science
- STOC '01
- 6 July 2001

Many combinatorial search problems can be expressed as “constraint satisfaction problems” using an appropriate “constraint language”, that is, a set of relations over some fixed finite set of values.… Expand

A Maximal Tractable Class of Soft Constraints

- D. Cohen, M. Cooper, Peter Jeavons, Andrei A. Krokhin
- Computer Science, Mathematics
- IJCAI
- 9 August 2003

Many researchers in artificial intelligence are beginning to explore the use of soft constraints to express a set of (possibly conflicting) problem requirements. A soft constraint is a function… Expand

Algebraic approach to promise constraint satisfaction

- Jakub Bulin, Andrei A. Krokhin, Jakub Opršal
- Computer Science, Mathematics
- STOC
- 2 November 2018

The complexity and approximability of the constraint satisfaction problem (CSP) has been actively studied over the last 20 years. A new version of the CSP, the promise CSP (PCSP) has recently been… Expand

Skew Bisubmodularity and Valued CSPs

- A. Huber, Andrei A. Krokhin, R. Powell
- Computer Science, Mathematics
- SODA
- 6 January 2013

An instance of the (finite-)Valued Constraint Satisfaction Problem (VCSP) is given by a finite set of variables, a finite domain of values, and a sum of (rational-valued) functions, each function… Expand

Skew Bisubmodularity and Valued CSPs

- A. Huber, Andrei A. Krokhin, R. Powell
- Computer Science, Mathematics
- SIAM J. Comput.
- 8 May 2014

An instance of the (finite-)valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of values, and a sum of (rational-valued) functions, with each… Expand