Булатов, Андрей Арнольдович

Материал из Википедии — свободной энциклопедии
Перейти к навигации Перейти к поиску
В Википедии есть статьи о других людях с такой фамилией, см. Булатов; Булатов, Андрей.
Андрей Арнольдович Булатов
Дата рождения 11 января 1975(1975-01-11) (49 лет)
Место рождения Алапаевск
Страна  СССР →  Россия
Место работы
Альма-матер Уральский государственный университет
Учёная степень доктор физико-математических наук
Учёное звание профессор
Научный руководитель Evgeny Vital'evich Sukhanov[d][1]
Награды и премии
Внешние изображения
Фотография Андрея Арнольдовича Булатова

Андрей Арнольдович Булатов — доктор физико-математических наук, профессор, доцент, лауреат премии Гёделя (2021).

Биография[править | править код]

Родился в Алапаевске Свердловской области.

Окончил математико-механический факультет Уральского государственного университета по специальности «математика». По 2002 год работал в УрГУ, с 2002 по 2005 год обучался в докторантуре университета под руководством профессора Л. Н. Шеврина. В настоящее время работает в Университете Саймона Фрейзера в Канаде.

Автор множества научных и учебно-методических работ. Выполнил циклы исследований по решеткам клонов и по приложениям универсальной алгебры к теории сложности вычислений. В 2002 году был удостоен приза за лучшую работу на 43-м Международном симпозиуме по основаниям компьютерных наук в Ванкувере в США. Лауреат премии УФУ за высокие достижения в учебно-методической деятельности в 2006 году[2][3][4][5].

Основные труды[править | править код]

  • Bulatov, Andrei A. Constraint satisfaction problems: complexity and algorithms. (English) Zbl 06894736 Klein, Shmuel Tomi (ed.) et al., Language and automata theory and applications. 12th international conference, LATA 2018, Ramat Gan, Israel, April 9—11, 2018. Proceedings. Cham: Springer (ISBN 978-3-319-77312-4/pbk; 978-3-319-77313-1/ebook). Lecture Notes in Computer Science 10792, 1-25 (2018). MSC: 68Q45
  • Bulatov, Andrei A. (ed.); Hirsch, Edward A. (ed.); Pin, Jean-Éric (ed.) Preface. (English) Zbl 1372.00093 Theory Comput. Syst. 61, No. 2, 261—262 (2017). MSC: 00B25 68-06
  • Bulatov, Andrei A.; Karpova, Olga; Shur, Arseny M.; Startsev, Konstantin Lower bounds on words separation: are there short identities in transformation semigroups? (English) Zbl 1372.68156 Electron. J. Comb. 24, No. 3, Research Paper P3.35, 12 p. (2017). MSC: 68Q45 20B30 20M20 68Q70 68R15
  • Bulatov, Andrei; Goldberg, Leslie Ann; Jerrum, Mark; Richerby, David; Živný, Stanislav Functional clones and expressibility of partition functions. (English) Zbl 06730360 Theor. Comput. Sci. 687, 11-39 (2017). MSC: 08A40
  • Bulatov, Andrei A. Graphs of relational structures, restricted types. (English) Zbl 06863534 Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5—8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 642—651 (2016). MSC: 68Q25 05C25
  • Bulatov, A. (ed.); Kreutzer, S. (ed.) Preface. (English) Zbl 1354.00085 Theory Comput. Syst. 59, No. 2, 159—160 (2016). MSC: 00B25 68-06
  • Bulatov, Andrei; Kozik, Marcin; Mayr, Peter; Steindl, Markus The subpower membership problem for semigroups. (English) Zbl 06663545 Int. J. Algebra Comput. 26, No. 7, 1435—1451 (2016). MSC: 20M99 68Q25
  • Bulatov, Andrei A. Conservative constraint satisfaction re-revisited. (English) Zbl 1346.68108 J. Comput. Syst. Sci. 82, No. 2, 347—356 (2016). MSC: 68Q25
  • Bulatov, Andrei A.; Hedayaty, Amir Galois correspondence for counting quantifiers. (English) Zbl 06930501 J. Mult.-Val. Log. Soft Comput. 24, No. 5-6, 405—424 (2015). MSC: 08A70 08A40 06A15 68Q25
  • Bulatov, Andrei A.; Skvortsov, Evgeny S. Phase transition for local search on planted SAT. (English) Zbl 06482807 Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24—28, 2015. Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-48053-3/pbk; 978-3-662-48054-0/ebook). Lecture Notes in Computer Science 9235, 175—186 (2015). MSC: 68Qxx
  • Bulatov, Andrei A. Boolean max-co-clones. (English) Zbl 1348.08004 Algebra Univers. 74, No. 1-2, 139—162 (2015). Reviewer: Lavinia Ciungu (Iowa City) MSC: 08A70 08A40 06B99
  • Bulatov, Andrei A. Counting constraint satisfaction problems. (English) Zbl 1373.68255 Jang, Sun Young (ed.) et al., Proceedings of the International Congress of Mathematicians (ICM 2014), Seoul, Korea, August 13—21, 2014. Vol. IV: Invited lectures. Seoul: KM Kyung Moon Sa (ISBN 978-89-6105-807-0/hbk; 978-89-6105-803-2/set). 561—584 (2014). MSC: 68Q25 68Q17
  • Bulatov, Andrei A.; Wang, Cong Approximating highly satisfiable random 2-SAT. (English) Zbl 06348076 Sinz, Carsten (ed.) et al., Theory and applications of satisfiability testing — SAT 2014. 17th international conference, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 14—17, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-09283-6/pbk). Lecture Notes in Computer Science 8561, 384—398 (2014). MSC: 68Q25 68T20
  • Bulatov, Andrei A.; Marx, Dániel Constraint satisfaction parameterized by solution size. (English) Zbl 1360.68499 SIAM J. Comput. 43, No. 2, 573—616 (2014). MSC: 68Q25 68Q17
  • Bulatov, Andrei; Dalmau, Victor; Thurley, Marc Descriptive complexity of approximate counting CSPs. (English) Zbl 1356.68090 Ronchi della Rocca, Simona (ed.), Computer science logic 2013. Selected papers of the 27th CSL workshop and 22nd annual conference of the European Association for Computer Science Logic (EACSL), Torino, Italy, September 2—5, 2013. Wadern: Schloss Dagstuhl — Leibniz Zentrum für Informatik (ISBN 978-3-939897-60-6). LIPICS — Leibniz International Proceedings in Informatics 23, 149—164 (2013). MSC: 68Q19
  • Bulatov, Andrei A. The complexity of the counting constraint satisfaction problem. (English) Zbl 1281.68130 J. ACM 60, No. 5, Article No. 34, 41 p. (2013). MSC: 68Q25 08A40 08A70 68Q15 68T20
  • Bulatov, Andrei A.; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Mcquillan, Colin The expressibility of functions on the Boolean domain, with applications to counting CSPs. (English) Zbl 1281.68131 J. ACM 60, No. 5, Article No. 32, 36 p. (2013). MSC: 68Q25 68W25 90C60
  • Bulatov, Andrei A. (ed.); Shur, Arseny M. (ed.) Computer science — theory and applications. 8th international computer science symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25—29, 2013. Proceedings. (English) Zbl 1264.68003 Lecture Notes in Computer Science 7913. Berlin: Springer (ISBN 978-3-642-38535-3/pbk). xii, 445 p. (2013). MSC: 68-06 68Qxx 00B25
  • Bulatov, Andrei A.; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark Log-supermodular functions, functional clones and counting CSPs. (English) Zbl 1245.68100 Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th — March 3rd, 2012. Wadern: Schloss Dagstuhl — Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPICS — Leibniz International Proceedings in Informatics 14, 302—313, electronic only (2012). MSC: 68Q25 68Q15
  • Bulatov, Andrei; Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Jerrum, Mark; Richerby, David The complexity of weighted and unweighted #CSP. (English) Zbl 1282.68110 J. Comput. Syst. Sci. 78, No. 2, 681—688 (2012). MSC: 68Q15
  • Bulatov, Andrei A.; Dalmau, Víctor; Grohe, Martin; Marx, Dániel Enumerating homomorphisms. (English) Zbl 1253.68165 J. Comput. Syst. Sci. 78, No. 2, 638—650 (2012). MSC: 68Q25 05C30 68R05
  • Bulatov, Andrei A.; Hedayaty, Amir Counting problems and clones of functions. (English) Zbl 1236.68194 J. Mult.-Val. Log. Soft Comput. 18, No. 2, 117—138 (2012). MSC: 68R05 03B50 08A40 68Q25
  • Bulatov, Andrei A. Complexity of conservative constraint satisfaction problems. (English) Zbl 1351.68113 ACM Trans. Comput. Log. 12, No. 4, Article No. 24, 66 p. (2011). MSC: 68Q25 05C15 68T20
  • Bulatov, Andrei A.; Marx, Dániel Constraint satisfaction parameterized by solution size. (English) Zbl 1333.68136 Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4—8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 424—436 (2011). MSC: 68Q25 68Q17
  • Bulatov, Andrei A. On the CSP dichotomy conjecture. (English) Zbl 1332.68065 Kulikov, Alexander (ed.) et al., Computer science — theory and applications. 6th international computer science symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14—18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20711-2/pbk). Lecture Notes in Computer Science 6651, 331—344 (2011). MSC: 68Q25 68T20
  • Bulatov, Andrei A.; Marx, Daniel The complexity of global cardinality constraints. (English) Zbl 1202.68208 Log. Methods Comput. Sci. 6, No. 4, Paper No. 4, 27 p. (2010). MSC: 68Q25
  • Bulatov, Andrei A.; Dalmau, Víctor; Grohe, Martin; Marx, Dániel Enumerating homomorphisms. (English) Zbl 1236.68105 Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26—28, 2009. Wadern: Schloss Dagstuhl — Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPICS — Leibniz International Proceedings in Informatics 3, 231—242, electronic only (2009). MSC: 68Q25 05C30 68R05
  • Börner, F.; Bulatov, A.; Chen, H.; Jeavons, P.; Krokhin, A. The complexity of constraint satisfaction games and QCSP. (English) Zbl 1188.68269 Inf. Comput. 207, No. 9, 923—944 (2009). MSC: 68T20 68Q25 91A05
  • Bulatov, Andrei; Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David The complexity of weighted Boolean #CSP with mixed signs. (English) Zbl 1171.68013 Theor. Comput. Sci. 410, No. 38-40, 3949-3961 (2009). MSC: 68Q25 68T20
  • Atserias, Albert; Bulatov, Andrei; Dawar, Anuj Affine systems of equations and counting infinitary logic. (English) Zbl 1168.68040 Theor. Comput. Sci. 410, No. 18, 1666—1683 (2009). MSC: 68T20 03C13 03C75 08A70 68Q25
  • Bulatov, Andrei A.; Krokhin, Andrei; Larose, Benoit Dualities for constraint satisfaction problems. (English) Zbl 1171.68494 Creignou, Nadia (ed.) et al., Complexity of constraints. An overview of current research themes. Berlin: Springer (ISBN 978-3-540-92799-0/pbk). Lecture Notes in Computer Science 5250, 93-124 (2008). MSC: 68Q25 03B70 08A70
  • Bulatov, Andrei A.; Valeriote, Matthew A. Recent results on the algebraic approach to the CSP. (English) Zbl 1171.08300 Creignou, Nadia (ed.) et al., Complexity of constraints. An overview of current research themes. Berlin: Springer (ISBN 978-3-540-92799-0/pbk). Lecture Notes in Computer Science 5250, 68-92 (2008). MSC: 08A70 03B70
  • Bulatov, Andrei A. The complexity of the counting constraint satisfaction problem. (English) Zbl 1153.68386 Aceto, Luca (ed.) et al., Automata, languages and programming. 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7—11, 2008. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-70574-1/pbk). Lecture Notes in Computer Science 5125, 646—661 (2008). MSC: 68Q25
  • Atserias, Albert; Bulatov, Andrei; Dawar, Anuj Affine systems of equations and counting infinitary logic. (English) Zbl 1171.68721 Arge, Lars (ed.) et al., Automata, languages and programming. 34th international colloquium, ICALP 2007, Wrocł aw, Poland, July 9—13, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73419-2/pbk). Lecture Notes in Computer Science 4596, 558—570 (2007). MSC: 68T20 03C13 03C75 08A70 68Q25
  • Atserias, Albert; Bulatov, Andrei; Dalmau, Victor On the power of k-consistency. (English) Zbl 1171.68720 Arge, Lars (ed.) et al., Automata, languages and programming. 34th international colloquium, ICALP 2007, Wrocł aw, Poland, July 9—13, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73419-2/pbk). Lecture Notes in Computer Science 4596, 279—290 (2007). MSC: 68T20
  • Bulatov, Andrei; Chen, Hubie; Dalmau, Víctor Learning intersection-closed classes with signatures. (English) Zbl 1127.68044 Theor. Comput. Sci. 382, No. 3, 209—220 (2007). MSC: 68Q32 68W05
  • Bulatov, Andrei A.; Dalmau, Víctor Towards a dichotomy theorem for the counting constraint satisfaction problem. (English) Zbl 1115.68141 Inf. Comput. 205, No. 5, 651—678 (2007). MSC: 68T20 68Q25
  • Bulatov, Andrei A. A dichotomy theorem for constraint satisfaction problems on a 3-element set. (English) Zbl 1316.68057 J. ACM 53, No. 1, 66-120 (2006). MSC: 68Q25 68Q17 68T20
  • Bulatov, A. A. The property of being polynomial for Mal’tsev constraint satisfaction problems. (Russian, English) Zbl 1164.08307 Algebra Logika 45, No. 6, 655—686 (2006); translation in Algebra Logic 45, No. 6, 371—388 (2006). MSC: 08A70 68Q25 68T20
  • Bulatov, Andrei A.; Skvortsov, Evgeny S. Efficiency of local search. (English) Zbl 1187.68534 Biere, Armin (ed.) et al., Theory and applications of satisfiability testing — SAT 2006. 9th international conference, Seattle, WA, USA, August 12—15, 2006. Proceedings. Berlin: Springer (ISBN 3-540-37206-7/pbk). Lecture Notes in Computer Science 4121, 297—310 (2006). MSC: 68T20
  • Bulatov, Andrei A. Combinatorial problems raised from 2-semilattices. (English) Zbl 1110.08001 J. Algebra 298, No. 2, 321—339 (2006). Reviewer: Christoph Meinel (Potsdam) MSC: 08A40 68Q25 68T20 06A07 06A12 08A70
  • Bulatov, Andrei; Dalmau, Víctor A simple algorithm for Mal’tsev constraints. (English) Zbl 1112.08002 SIAM J. Comput. 36, No. 1, 16-27 (2006). MSC: 08A70 68Q25 68T20
  • Bulatov, A. A. Complexity of the counting constraint satisfaction problem. (Russian. English summary) Zbl 1208.68198 Izv. Ural. Gos. Univ. 36, Mat. Mekh. 7, 67-82, 190 (2005). MSC: 68T20 68Q25
  • Bulatov, Andrei A. Three-element Mal’tsev algebras. (English) Zbl 1104.08001 Acta Sci. Math. 71, No. 3-4, 469—500 (2005). Reviewer: Manfred Armbrust (Köln) MSC: 08A40 08B05 08A30 08-04
  • Bulatov, Andrei A. H-coloring dichotomy revisited. (English) Zbl 1086.68052 Theor. Comput. Sci. 349, No. 1, 31-39 (2005). MSC: 68Q25 05C15 05C85 68T20
  • Krokhin, Andrei; Bulatov, Andrei; Jeavons, Peter The complexity of constraint satisfaction: an algebraic approach. (English) Zbl 1087.68107 Kudryavtsev, Valery B. et al., Structural theory of automata, semigroups, and universal algebra. Proceedings of the NATO Advanced Study Institute, Montreal, Quebec, Canada, July 7—18, 2003. Dordrecht: Kluwer Academic Publishers (ISBN 1-4020-3815-1/hbk; 1-4020-3817-8/e-book). NATO Science Series II: Mathematics, Physics and Chemistry 207, 181—213 (2005). MSC: 68T20 68Q25
  • Bulatov, Andrei; Grohe, Martin The complexity of partition functions. (English) Zbl 1081.68030 Theor. Comput. Sci. 348, No. 2-3, 148—186 (2005). MSC: 68Q25 05C15 68R10 68T20
  • Bulatov, Andrei; Jeavons, Peter; Krokhin, Andrei Classifying the complexity of constraints using finite algebras. (English) Zbl 1071.08002 SIAM J. Comput. 34, No. 3, 720—742 (2005). MSC: 08A70 68Q25 68T20 90C27
  • Bulatov, A. A. The complexity of the conservative generalized satisfiability problem. (English. Russian original) Zbl 1378.68065 Dokl. Math. 70, No. 1, 597—598 (2004); translation from Dokl. Akad. Nauk 397, No. 5, 583—585 (2004). MSC: 68Q25 06E30 68Q17
  • Bulatov, Andrei; Grohe, Martin The complexity of partition functions. (English) Zbl 1098.68616 Díaz, Josep (ed.) et al., Automata, languages and programming. 31st international colloquium, ICALP 2004, Turku, Finland, July 12—16, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22849-7/pbk). Lecture Notes in Computer Science 3142, 294—306 (2004). MSC: 68Q25 05C15 68R10 68T20 82B05
  • Bulatov, Andrei; Chen, Hubie; Dalmau, Víctor Learnability of relatively quantified generalized formulas. (English) Zbl 1110.68391 Ben-David, Shai (ed.) et al., Algorithmic learning theory. 15th international conference, ALT 2004, Padova, Italy, October 2—5, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23356-3/pbk). Lecture Notes in Computer Science 3244. Lecture Notes in Artificial Intelligence, 365—379 (2004). MSC: 68Q32
  • Bulatov, Andrei A.; Jeavons, Peter An algebraic approach to multi-sorted constraints. (English) Zbl 1273.68337 Rossi, Francesca (ed.), Principles and practice of constraint programming — CP 2003. 9th international conference, CP 2003, Kinsale, Ireland, September 29 — October 3, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20202-1/pbk). Lect. Notes Comput. Sci. 2833, 183—198 (2003). MSC: 68T20 68P15
  • Börner, Ferdinand; Bulatov, Andrei; Jeavons, Peter; Krokhin, Andrei Quantified constraints: Algorithms and complexity. (English) Zbl 1116.03314 Baaz, Matthias (ed.) et al., Computer science logic. 17th international workshop CSL 2003, 12th annual conference of the EACSL, 8th Kurt Gödel colloquium KGC 2003, Vienna, Austria, August 25—30, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40801-0/pbk). Lect. Notes Comput. Sci. 2803, 58-70 (2003). MSC: 03B70 68Q25 68T20
  • Bulatov, Andrei A.; Idziak, Paweł M. Counting Mal’tsev clones on small sets. (English) Zbl 1023.08004 Discrete Math. 268, No. 1-3, 59-80 (2003). MSC: 08A40 08B05
  • Bulatov, Andrei; Jeavons, Peter; Volkov, Mikhail Finite semigroups imposing tractable constraints. (English) Zbl 1032.20037 Gomes, Gracinda M. S. (ed.) et al., Semigroups, algorithms, automata and languages. Proceedings of workshops held at the International Centre of Mathematics, CIM, Coimbra, Portugal, May, June and July 2001. Singapore: World Scientific. 313—329 (2002). Reviewer: Francine Blanchet-Sadri (Greensboro) MSC: 20M05 68Q25
  • Bulatov, Andrei A. Polynomial clones containing the Mal’tsev operation of the groups \bbfZp2 and \bbfZp×\bbfZp. (English) Zbl 1022.08001 Mult.-Valued Log. 8, No. 2, 193—221 (2002). MSC: 08A40 08A30
  • Bulatov, Andrei; Krokhin, Andrei; Jeavons, Peter The complexity of maximal constraint languages. (English) Zbl 1323.68294 Proceedings of the thirty-third annual ACM symposium on theory of computing, STOC 2001. Hersonissos, Crete, Greece, July 6—8, 2001. New York, NY: ACM Press (ISBN 1-581-13349-9). 667—674 (2001). MSC: 68Q17 68Q25 68T20
  • Bulatov, Andrei A. Conditions satisfied by clone lattices. (English) Zbl 1058.06005 Algebra Univers. 46, No. 1-2, 237—241 (2001). Reviewer: Ivan Chajda (Olomouc) MSC: 06B05 08A40
  • Bulatov, A.; Krokhin, A.; Safin, K.; Semigrodskikh, A.; Sukhanov, E. On the structure of clone lattices. II. (English) Zbl 1008.08001 Mult.-Valued Log. 7, No. 5-6, 379—389 (2001). MSC: 08A40
  • Bulatov, Andrei On the number of finite Mal’tsev algebras. (English) Zbl 0986.08003 Chajda, I. (ed.) et al., Contributions to general algebra 13. Proceedings of the 60th workshop on general algebra «60. Arbeitstagung Allgemeine Algebra», Dresden, Germany, June 22-25, 2000 and of the summer school ’99 on general algebra and ordered sets, Velké Karlovice, Czech Republic, August 30-September 4, 1999. Klagenfurt: Verlag Johannes Heyn. Contrib. Gen. Algebra. 13, 41-54 (2001). MSC: 08A40 03B50
  • Bulatov, Andrei A.; Krokhin, Andrei A.; Jeavons, Peter Constraint satisfaction problems and finite algebras. (English) Zbl 0973.68181 Montanari, Ugo (ed.) et al., Automata, languages and programming. 27th international colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1853, 272—282 (2000). MSC: 68R05 68T20 08A40
  • Bulatov, A. A. Abstract properties of the class of intervals in the lattices of closed classes. (English. Russian original) Zbl 0976.08001 Discrete Math. Appl. 10, No. 5, 481—498 (2000); translation from Diskret. Mat. 12, No. 4, 95-113 (2000). MSC: 08A40 03G10 08B20 03B50
  • Bulatov, A. A. On one semigroup property of clones. (English) Zbl 0971.08001 Kublanovsky, S. (ed.) et al., Semigroups with applications, including semigroup rings. International conference in honour of E. S. Lyapin, St.-Petersburg, Russia, June 19-30, 1995. St.-Petersburg: Severny Ochag, 63-66 (1999). Reviewer: E.Płonka (Wodzisław) MSC: 08A40 08A02 20M99
  • Bulatov, A. A. Sublattices of a lattice of clones of functions on a 3-element set. I. (English. Russian original) Zbl 0936.06005 Algebra Logika 38, No. 1, 3-23 (1999); translation in Algebra Logic 38, No. 1, 1-11 (1999). Reviewer: A.N.Ryaskin (Novosibirsk) MSC: 06B15 06A12 08A40
  • Bulatov, Andrei A. Some infinite intervals in clone lattices. (English) Zbl 0929.08003 Discuss. Math., Algebra Stoch. Methods 19, No. 1, 63-74 (1999). MSC: 08A40 08A02 03B50
  • Bulatov, A. A. Sublattices of the lattice of clones of functions on a 3-element set. II. (English. Russian original) Zbl 0949.06001 Algebra Logika 38, No. 3, 269—295 (1999); translation in Algebra Logic 38, No. 3, 144—158 (1999). Reviewer: A.N.Ryaskin (Novosibirsk) MSC: 06B15 06A12 08A40
  • Bulatov, A. A. Polynomial reducts of modules. II. Algebras of primitive and nilpotent functions. (English) Zbl 0923.08002 Mult.-Valued Log. 3, No. 3, 173—193 (1998). Reviewer: B.Wojdyło (Toruń) MSC: 08A40 03B50
  • Bulatov, A. A. Polynomial reducts of modules. I. Rough classification. (English) Zbl 0909.08003 Mult.-Valued Log. 3, No. 2, 135—154 (1998). Reviewer: B.Wojdyło (Toruń) MSC: 08A40 08A30 03B50
  • Bulatov, A.; Bertulis, A.; Mickienė, L. Geometrical illusions: Study and modelling. (English) Zbl 0899.92042 Biol. Cybern. 77, No. 6, 395—406 (1997). MSC: 91E30
  • Bulatov, A. A. Polynomial reducts of modules. (English. Russian original) Zbl 0889.08005 Russ. Math. 40, No. 10, 73-76 (1996); translation from Izv. Vyssh. Uchebn., Mat 1996, No. 10(413), 76-79 (1996). Reviewer: D.Busneag (Craiova) MSC: 08A30 08A40 06B05

Публикации[править | править код]

  • Полиномиальность мальцевских задач CSP; А. А. Булатов; Алгебра и логика, 45:6 (2006), 655—686;
  • Абстрактные свойства класса интервалов решеток замкнутых классов; А. А. Булатов; Дискрет. матем., 12:3 (2000), 95-113;
  • Полиномиальные редукты модулей; А. А. Булатов; Изв. вузов. Матем., 1996, № 10, 76-79.

Примечания[править | править код]

  1. ↑ Mathematics Genealogy Project (англ.) — 1997.
  2. ↑ Уральский государственный университет в биографиях (2010). Уральский федеральный университет. Дата обращения: 19 сентября 2018. Архивировано 13 февраля 2018 года.
  3. ↑ Уральский государственный университет в биографиях. biography.ideafix.co. Дата обращения: 19 сентября 2018. Архивировано 28 февраля 2019 года.
  4. ↑ Булатов, Андрей Александрович. cs.sfu.ca. Дата обращения: 19 сентября 2018. Архивировано 24 февраля 2018 года.
  5. ↑ Committeers / The 9th International Computer Science Symposium in Russia. logic.pdmi.ras.ru. Дата обращения: 19 сентября 2018. Архивировано 10 марта 2014 года.

Ссылки[править | править код]

Источник — https://wiki4.ru/w/index.php?title=Булатов,_Андрей_Арнольдович&oldid=134830241