Folgen
Dmitry Sokolov
Dmitry Sokolov
Bestätigte E-Mail-Adresse bei epfl.ch
Titel
Zitiert von
Zitiert von
Jahr
Monotone circuit lower bounds from resolution
A Garg, M Göös, P Kamath, D Sokolov
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
532018
Adventures in monotone complexity and TFNP
M Göös, P Kamath, R Robere, D Sokolov
10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2018
352018
Dag-like communication and its applications
D Sokolov
Computer Science–Theory and Applications: 12th International Computer …, 2017
322017
Lower bounds for splittings by linear combinations
D Itsykson, D Sokolov
Mathematical Foundations of Computer Science 2014: 39th International …, 2014
252014
Reordering rule makes OBDD proof systems stronger
S Buss, D Itsykson, A Knop, D Sokolov
33rd Computational Complexity Conference (CCC 2018), 2018
202018
On obdd-based algorithms and proof systems that dynamically change the order of variables
D Itsykson, A Knop, A Romashchenko, D Sokolov
The Journal of Symbolic Logic 85 (2), 632-670, 2020
192020
Resolution over linear equations modulo two
D Itsykson, D Sokolov
Annals of Pure and Applied Logic 171 (1), 102722, 2020
152020
Definitions of acute renal dysfunction: An evolving clinical and biomarker paradigm
M Ostermann, VC Wu, D Sokolov, N Lumlertgul
Current opinion in critical care 27 (6), 553-559, 2021
82021
Lower bounds for myopic DPLL algorithms with a cut heuristic
D Itsykson, D Sokolov
Algorithms and Computation: 22nd International Symposium, ISAAC 2011 …, 2011
82011
(Semi) Algebraic proofs over {±1} variables
D Sokolov
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
72020
Trade-offs between size and degree in polynomial calculus
G Lagarde, J Nordström, D Sokolov, J Swernofsky
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
62020
Tight lower bounds on the resolution complexity of perfect matching principles
D Itsykson, V Oparin, M Slabodkin, D Sokolov
Fundamenta Informaticae 145 (3), 229-242, 2016
62016
The power of negative reasoning
SF de Rezende, M Lauria, J Nordström, D Sokolov
36th Computational Complexity Conference (CCC 2021), 2021
52021
Automating algebraic proof systems is np-hard
M Göös, J Nordström, T Pitassi, R Robere, SF de Rezende, D Sokolov
Electronic colloquium on computational complexity 27 (64), 2020
52020
The complexity of inverting explicit Goldreich’s function by DPLL algorithms
DM Itsykson, DO Sokolov
Journal of Mathematical Sciences 188, 47-58, 2013
42013
The complexity of inversion of explicit Goldreich’s function by DPLL algorithms
D Itsykson, D Sokolov
Computer Science–Theory and Applications: 6th International Computer Science …, 2011
42011
Lower Bounds on OBDD Proofs with Several Orders
S Buss, D Itsykson, A Knop, A Riazanov, D Sokolov
ACM Transactions on Computational Logic (TOCL) 22 (4), 1-30, 2021
32021
Automating algebraic proof systems is NP-hard
SF De Rezende, M Göös, J Nordström, T Pitassi, R Robere, D Sokolov
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
32021
The complexity of inversion of explicit Goldreich's function by DPLL algorithms
DM Itsykson, DO Sokolov
Записки научных семинаров ПОМИ 399 (0), 88-108, 2012
32012
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
SF de Rezende, J Nordström, K Risse, D Sokolov
arXiv preprint arXiv:1912.00534, 2019
22019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20