Folgen
Andrei Bulatov
Titel
Zitiert von
Zitiert von
Jahr
Classifying the complexity of constraints using finite algebras
A Bulatov, P Jeavons, A Krokhin
SIAM journal on computing 34 (3), 720-742, 2005
6962005
A dichotomy theorem for nonuniform CSPs
AA Bulatov
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
4812017
A dichotomy theorem for constraint satisfaction problems on a 3-element set
AA Bulatov
Journal of the ACM (JACM) 53 (1), 66-120, 2006
3782006
Tractable conservative constraint satisfaction problems
AA Bulatov
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings …, 2003
2702003
Classifying the complexity of constraints using finite algebras
A Bulatov, A Krokhin, PG Jeavons
submitted, 2003
209*2003
A dichotomy theorem for constraints on a three-element set
AA Bulatov
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002
2072002
A simple algorithm for Mal'tsev constraints
A Bulatov, V Dalmau
SIAM Journal on Computing 36 (1), 16-27, 2006
1762006
Complexity of conservative constraint satisfaction problems
AA Bulatov
ACM Transactions on Computational Logic (TOCL) 12 (4), 1-66, 2011
1712011
The complexity of partition functions
A Bulatov, M Grohe
Theoretical Computer Science 348 (2-3), 148-186, 2005
1662005
Ant colony optimization and swarm intelligence
M Birattari, C Blum, LM Gambardella, F Mondada, T Stntzle
4th International Workshop, ANTS 2004: September 5–8, 2004, Brussels …, 2008
126*2008
The complexity of the counting constraint satisfaction problem
AA Bulatov
Journal of the ACM (JACM) 60 (5), 1-41, 2013
1222013
Affine systems of equations and counting infinitary logic
A Atserias, A Bulatov, A Dawar
Theoretical Computer Science 410 (18), 1666-1683, 2009
1092009
Malt'sev constraints are tractable
A Bulatov, V Dalmau
Oxford University Computing Laboratory, 2002
1072002
The complexity of the counting constraint satisfaction problem
AA Bulatov
International Colloquium on Automata, Languages, and Programming, 646-661, 2008
1062008
H-coloring dichotomy revisited
AA Bulatov
Theoretical Computer Science 349 (1), 31-39, 2005
1062005
The complexity of maximal constraint languages
A Bulatov, A Krokhin, P Jeavons
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
1002001
Algebraic structures in combinatorial problems
A Bulatov, P Jeavons
Technische Universitat Dresden, 2001
982001
Towards a dichotomy theorem for the counting constraint satisfaction problem
AA Bulatov, V Dalmau
Information and Computation 205 (5), 651-678, 2007
902007
Quantified constraints: Algorithms and complexity
F Börner, A Bulatov, P Jeavons, A Krokhin
Computer Science Logic: 17th International Workshop CSL 2003, 12th Annual …, 2003
902003
Towards a dichotomy theorem for the counting constraint satisfaction problem
AA Bulatov, V Dalmau
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
862003
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20