Andrei A. Bulatov

From MaRDI portal
Person:414930

Available identifiers

zbMath Open bulatov.andrei-aWikidataQ60826922 ScholiaQ60826922MaRDI QIDQ414930

List of research outcomes

PublicationDate of PublicationType
On the complexity of CSP-based ideal membership problems2023-12-08Paper
Complexity classification of counting graph homomorphisms modulo a prime number2023-12-08Paper
Approximate Counting CSP Seen from the Other Side2022-12-05Paper
https://portal.mardi4nfdi.de/entity/Q50911782022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50924222022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50924232022-07-21Paper
The Ideal Membership Problem and Abelian Groups2022-01-13Paper
Satisfiability threshold for power law random 2-SAT in configuration model2021-09-27Paper
Dismantlability, connectedness, and mixing in relational structures2021-02-03Paper
https://portal.mardi4nfdi.de/entity/Q51446962021-01-19Paper
Separation of congruence intervals and implications2020-07-11Paper
Local structure of idempotent algebras II2020-06-17Paper
Local structure of idempotent algebras I2020-06-16Paper
Satisfiability threshold for power law random 2-SAT in configuration model2020-05-20Paper
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin2020-02-24Paper
Constraint satisfaction problems over semilattice block Mal'tsev algebras2019-09-17Paper
Concentration inequalities for sums of random variables, each having power bounded tails2019-03-06Paper
https://portal.mardi4nfdi.de/entity/Q46257002019-02-25Paper
Counting homomorphisms in plain exponential time2018-10-07Paper
https://portal.mardi4nfdi.de/entity/Q45838092018-09-03Paper
Constraint satisfaction problems: complexity and algorithms2018-06-26Paper
Graphs of relational structures2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q45890192017-11-06Paper
Lower bounds on words separation: are there short identities in transformation semigroups?2017-09-08Paper
Functional clones and expressibility of partition functions2017-06-13Paper
https://portal.mardi4nfdi.de/entity/Q29585202017-02-02Paper
The subpower membership problem for semigroups2016-12-14Paper
Conservative constraint satisfaction re-revisited2015-12-11Paper
Complexity of conservative constraint satisfaction problems2015-09-17Paper
Phase Transition for Local Search on Planted SAT2015-09-16Paper
Boolean max-co-clones2015-09-01Paper
The complexity of maximal constraint languages2015-02-27Paper
Approximating Highly Satisfiable Random 2-SAT2014-09-26Paper
Constraint Satisfaction Parameterized by Solution Size2014-07-30Paper
The expressibility of functions on the boolean domain, with applications to counting CSPs2014-02-17Paper
The complexity of the counting constraint satisfaction problem2014-02-17Paper
https://portal.mardi4nfdi.de/entity/Q29047712012-08-23Paper
Enumerating homomorphisms2012-05-11Paper
The complexity of weighted and unweighted \(\#\)CSP2012-05-11Paper
https://portal.mardi4nfdi.de/entity/Q53893382012-04-26Paper
https://portal.mardi4nfdi.de/entity/Q53899802012-04-24Paper
Constraint Satisfaction Parameterized by Solution Size2011-07-06Paper
On the CSP Dichotomy Conjecture2011-06-17Paper
The complexity of global cardinality constraints2010-12-20Paper
https://portal.mardi4nfdi.de/entity/Q35651182010-05-27Paper
Principles and Practice of Constraint Programming – CP 20032010-03-02Paper
The complexity of constraint satisfaction games and QCSP2009-09-14Paper
The complexity of weighted Boolean \#CSP with mixed signs2009-09-10Paper
Affine systems of equations and counting infinitary logic2009-04-29Paper
Recent Results on the Algebraic Approach to the CSP2009-01-22Paper
Dualities for Constraint Satisfaction Problems2009-01-22Paper
A dichotomy theorem for constraint satisfaction problems on a 3-element set2008-12-21Paper
The property of being polynomial for Mal’tsev constraint satisfaction problems2008-12-18Paper
The Complexity of the Counting Constraint Satisfaction Problem2008-08-28Paper
On the Power of k-Consistency2007-11-28Paper
Affine Systems of Equations and Counting Infinitary Logic2007-11-28Paper
Learning intersection-closed classes with signatures2007-09-18Paper
Efficiency of Local Search2007-09-04Paper
Computer Science Logic2007-06-21Paper
Towards a dichotomy theorem for the counting constraint satisfaction problem2007-05-14Paper
https://portal.mardi4nfdi.de/entity/Q54780792007-01-02Paper
Combinatorial problems raised from 2-semilattices2006-07-12Paper
A Simple Algorithm for Mal'tsev Constraints2006-06-01Paper
\(H\)-coloring dichotomy revisited2006-03-20Paper
https://portal.mardi4nfdi.de/entity/Q33658402006-02-13Paper
The complexity of partition functions2006-01-09Paper
Classifying the Complexity of Constraints Using Finite Algebras2005-09-16Paper
Automata, Languages and Programming2005-08-24Paper
Algorithmic Learning Theory2005-08-18Paper
Conditions satisfied by clone lattices.2005-04-19Paper
https://portal.mardi4nfdi.de/entity/Q44074312004-01-04Paper
Polynomial Clones Containing the Mal'tsev Operation of the Groups {\open Z}_{p^{2}} and {\open Z}_p \times {\open Z}_p2003-11-02Paper
Counting Mal'tsev clones on small sets2003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q45443722002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q27598252001-12-18Paper
https://portal.mardi4nfdi.de/entity/Q27541502001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45084472001-10-30Paper
https://portal.mardi4nfdi.de/entity/Q47003682000-01-25Paper
https://portal.mardi4nfdi.de/entity/Q42683221999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q42214041999-04-11Paper
https://portal.mardi4nfdi.de/entity/Q43984531998-07-19Paper
Polynomial reducts of modules1998-04-01Paper
https://portal.mardi4nfdi.de/entity/Q47632721995-04-11Paper
Identities in the lattices of closed classes1994-09-08Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Andrei A. Bulatov