| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andrei A. Bulatov, Amir Hedayaty |
Counting Problems and Clones of Functions.  |
Multiple-Valued Logic and Soft Computing  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx |
Enumerating homomorphisms. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby |
The complexity of weighted and unweighted #CSP. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Log-supermodular functions, functional clones and counting CSPs. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Log-supermodular functions, functional clones and counting CSPs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov |
Complexity of conservative constraint satisfaction problems. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov |
On the CSP Dichotomy Conjecture. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Dániel Marx |
Constraint Satisfaction Parameterized by Solution Size. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Dániel Marx |
Constraint satisfaction problems and global cardinality constraints. |
Commun. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby |
The complexity of weighted and unweighted #CSP |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Dániel Marx |
The complexity of global cardinality constraints |
Logical Methods in Computer Science |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Andrei A. Bulatov, Anuj Dawar |
Affine systems of equations and counting infinitary logic. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The complexity of weighted Boolean #CSP with mixed signs. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinand Börner, Andrei A. Bulatov, Hubie Chen, Peter Jeavons, Andrei A. Krokhin |
The complexity of constraint satisfaction games and QCSP. |
Inf. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx |
Enumerating Homomorphisms |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx |
Enumerating Homomorphisms. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov |
Counting Problems and Clones of Functions. |
ISMVL |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Dániel Marx |
The Complexity of Global Cardinality Constraints. |
LICS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Evgeny S. Skvortsov |
Phase transition for Local Search on planted SAT |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Weighted Boolean #CSP with Mixed Signs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov |
The Complexity of the Counting Constraint Satisfaction Problem. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Andrei A. Krokhin, Benoit Larose |
Dualities for Constraint Satisfaction Problems. |
Complexity of Constraints |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Matthew Valeriote |
Recent Results on the Algebraic Approach to the CSP. |
Complexity of Constraints |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov |
The complexity of the counting constraint satisfaction problem. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Hubie Chen, Víctor Dalmau |
Learning intersection-closed classes with signatures. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau |
Towards a dichotomy theorem for the counting constraint satisfaction problem. |
Inf. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Andrei A. Bulatov, Anuj Dawar |
Affine Systems of Equations and Counting Infinitary Logic. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Andrei A. Bulatov, Víctor Dalmau |
On the Power of k -Consistency. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov |
A dichotomy theorem for constraint satisfaction problems on a 3-element set. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
dichotomy theorem, homomorphism problem, complexity, Constraint satisfaction problem |
| 1 | Andrei A. Bulatov, Víctor Dalmau |
A Simple Algorithm for Mal'tsev Constraints. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Evgeny S. Skvortsov |
Efficiency of Local Search. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov |
H-Coloring dichotomy revisited. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin Grohe |
The complexity of partition functions. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin |
Classifying the Complexity of Constraints Using Finite Algebras. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin Grohe |
The Complexity of Partition Functions. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Hubie Chen, Víctor Dalmau |
Learnability of Relatively Quantified Generalized Formulas. |
ALT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov |
A Graph of a Relational Structure and Constraint Satisfaction Problems. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Pawel M. Idziak |
Counting Mal'tsev clones on small sets. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Evgeny S. Skvortsov |
Amalgams of Constraint Satisfaction Problems. |
IJCAI |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Krokhin, Andrei A. Bulatov, Peter Jeavons |
Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. (PDF / PS) |
ISMVL |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov |
Tractable conservative Constraint Satisfaction Problems. |
LICS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau |
Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinand Börner, Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin |
Quantified Constraints: Algorithms and Complexity. |
CSL |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Peter Jeavons |
An Algebraic Approach to Multi-sorted Constraints. |
CP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov |
Mal'tsev constraints are tractable |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov |
Tractable Constraint Satisfaction Problems on a 3-element set |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov |
A Dichotomy Theorem for Constraints on a Three-Element Set. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons |
The complexity of maximal constraint languages. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
algebraic invariance property, constraint satisfaciton problem, relational clone, complexity, NP-completeness, tractability, constraint language |
| 1 | Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons |
Constraint Satisfaction Problems and Finite Algebras. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")