Alexander Smal
Alexander Smal
St. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences
Verified email at pdmi.ras.ru - Homepage
Title
Cited by
Cited by
Year
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
132012
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
112016
Prediction from partial information and hindsight, an alternative proof
AV Smal, N Talebanfard
Information Processing Letters 136, 102-104, 2018
62018
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
42013
Half-duplex communication complexity
K Hoover, R Impagliazzo, I Mihajlin, AV Smal
29th International Symposium on Algorithms and Computation (ISAAC 2018), 2018
22018
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
12018
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
2021
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS
K Hoover, R Impagliazzo, I Mihajlin, AV Smal, P Angelini, MA Bekos, ...
2018
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
The system can't perform the operation now. Try again later.
Articles 1–10