Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Itsykson, Dmitrii Mikhailovich

Statistics Math-Net.Ru
Total publications: 4
Scientific articles: 4
Presentations: 4

Number of views:
This page:791
Abstract pages:1001
Full texts:316
References:171
E-mail:

https://www.mathnet.ru/eng/person33728
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/767280
https://elibrary.ru/author_items.asp?authorid=152575

Publications in Math-Net.Ru Citations
2012
1. D. M. Itsykson, D. O. Sokolov, “The complexity of inversion of explicit Goldreich's function by DPLL algorithms”, Zap. Nauchn. Sem. POMI, 399 (2012),  88–108  mathnet  mathscinet; J. Math. Sci. (N. Y.), 188:1 (2013), 47–58  scopus 3
2. E. A. Hirsch, D. M. Itsykson, V. O. Nikolaenko, A. V. Smal, “Optimal heuristic algorithms for the image of an injective function”, Zap. Nauchn. Sem. POMI, 399 (2012),  15–31  mathnet  mathscinet; J. Math. Sci. (N. Y.), 188:1 (2013), 7–16  scopus
2009
3. E. A. Hirsch, D. M. Itsykson, “Infinitely frequently one-sided function based on an assumption on complexity in the mean”, Algebra i Analiz, 21:3 (2009),  130–144  mathnet  mathscinet  zmath; St. Petersburg Math. J., 21:3 (2010), 459–468  isi  scopus 1
2006
4. D. M. Itsykson, A. A. Kojevnikov, “Lower bounds of static Lovász–Schrijver calculus proofs for Tseitin tautologies”, Zap. Nauchn. Sem. POMI, 340 (2006),  10–32  mathnet  mathscinet  zmath; J. Math. Sci. (N. Y.), 145:3 (2007), 4942–4952  scopus 6

Presentations in Math-Net.Ru
1. Proof complexity lower bounds via communication arguments
D. M. Itsykson
General Mathematics Seminar of the St. Petersburg Division of Steklov Institute of Mathematics, Russian Academy of Sciences
November 22, 2021 13:00   
2. Цейтинские формулы и однопроходные ветвящиеся программы
D. M. Itsykson
Traditional winter session MIAN–POMI devoted to the topic "Mathematical logic"
December 24, 2018 16:55   
3. Сложность пропозициональных доказательств: краткая история, новые результаты и открытые вопросы
D. M. Itsykson
VIII Internet video conference "Day of Mathematics and Mechanics"
September 17, 2018
4. Structural complexity of probabilistic algorithms for bounded-error
D. M. Itsykson
Traditional Christmas session MIAN-POMI, 2009 "Logic and Theoretical Computer Science"
December 18, 2009 17:00   

Organisations
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024