|
|
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 ; J. Math. Sci. (N. Y.), 188:1 (2013), 47–58 |
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 ; J. Math. Sci. (N. Y.), 188:1 (2013), 7–16 |
|
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 ; St. Petersburg Math. J., 21:3 (2010), 459–468 |
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 ; J. Math. Sci. (N. Y.), 145:3 (2007), 4942–4952 |
6
|
|
Presentations in Math-Net.Ru |
|
|
Organisations |
|
|
|
|