Segui
Alexander Smal
Alexander Smal
St. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences; Technion
Email verificata su pdmi.ras.ru - Home page
Titolo
Citata da
Citata da
Anno
Toward better depth lower bounds: The XOR-KRW conjecture
I Mihajlin, A Smal
36th Computational Complexity Conference (CCC 2021), 38: 1-38: 24, 2021
152021
Circuit size lower bounds and# SAT upper bounds through a general framework
A Golovnev, AS Kulikov, AV Smal, S Tamaki
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
152016
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
EA Hirsch, D Itsykson, I Monakhov, A Smal
Theory of Computing Systems 51 (2), 179-195, 2012
152012
Half-duplex communication complexity
K Hoover, R Impagliazzo, I Mihajlin, AV Smal
29th International Symposium on Algorithms and Computation (ISAAC 2018), 10 …, 2018
122018
Prediction from partial information and hindsight, an alternative proof
AV Smal, N Talebanfard
Information Processing Letters 136, 102-104, 2018
102018
New bounds on the half-duplex communication complexity
Y Dementiev, A Ignatiev, V Sidelnik, A Smal, M Ushakov
International Conference on Current Trends in Theory and Practice of …, 2021
72021
Proving unsatisfiability with hitting formulas
Y Filmus, EA Hirsch, A Riazanov, A Smal, M Vinyals
arXiv preprint arXiv:2302.06241, 2023
62023
Irreducible subcube partitions
Y Filmus, E Hirsch, S Kurz, F Ihringer, A Riazanov, A Smal, M Vinyals
arXiv preprint arXiv:2212.14685, 2022
52022
Super-cubic lower bound for generalized karchmer-wigderson games
A Ignatiev, I Mihajlin, A Smal
33rd International Symposium on Algorithms and Computation (ISAAC 2022), 66 …, 2022
52022
Optimal heuristic algorithms for the image of an injective function
EA Hirsch, DM Itsykson, VO Nikolaenko, AV Smal
Journal of Mathematical Sciences 188 (1), 7-16, 2013
32013
Gate elimination: circuit size lower bounds and# SAT upper bounds
A Golovnev, AS Kulikov, AV Smal, S Tamaki
Theoretical Computer Science 719, 46-63, 2018
22018
Optimal heuristic algorithms for the image of an injective function
EA Hirsch, DM Itsykson, VO Nikolaenko, AV Smal
Записки научных семинаров ПОМИ 399 (0), 15-31, 2012
22012
Lifting dichotomies
Y Alekseev, Y Filmus, A Smal
39th Computational Complexity Conference (CCC 2024), 9: 1-9: 18, 2024
12024
Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
Y Filmus, R Schwartz, AV Smal
arXiv preprint arXiv:2411.05553, 2024
2024
LIPIcs, Volume 300, CCC 2024, Complete Volume}}
R Santhanam, WM Hoza, G Cormode, M Dall'Agnol, T Gur, C Hickey, ...
39th Computational Complexity Conference (CCC 2024) 300, 0, 2024
2024
LIPIcs, Volume 123, ISAAC'18, Complete Volume}}
WL Hsu, DT Lee, CS Liao, SH Teng, C Stein, G Ducoffe, A Popa, K Kurita, ...
29th International Symposium on Algorithms and Computation (ISAAC 2018) 123, 0, 2018
2018
29th International Symposium on Algorithms and Computation (ISAAC 2018)
SH Teng, C Stein, A Björklund, T Klimosová, J Malík, T Masarík, J Novotná, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018
2018
Circuit Size Lower Bounds and# SAT Upper Bounds Through a General Framework
S Tamaki, AS Kulikov, A Smal, A Golovnev
(No Title), 2016
2016
Succinct Interactive Proofs for Quantified Boolean Formulas
EA Hirsch, D van Melkebeek, A Smal
2013
On an optimal randomized acceptor for graph nonisomorphism Edward A. Hirsch Steklov Institute of Mathematics at St. Petersburg, Russian Academy of Sciences Dmitry Itsykson …
V Nikolaenko, A Smal
First Russian-Finnish Symposium on Discrete Mathematics 6 (4), 21, 2011
2011
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20