Scholar
Alexander S. Kulikov
Google Scholar ID: u3erCUkAAAAJ
JetBrains
Algorithms
Circuit complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
27,298
H-index
18
i10-index
32
Publications
20
Co-authors
35
list available
Publications
9 items
A Tight Cycle-Cover Inequality for Shortest Common Superstring
2026
Cited
1
The Greedy Superstring Algorithm Achieves Ratio 2 for Strings of Length 6 Already
2026
Cited
0
Improved Quantum Algorithms for Subset Sum and $k$-SUM
2026
Cited
0
If Edge Coloring is Hard under SETH, then SETH is False
2026
Cited
0
Complexity of the Graph Homomorphism Problem w.r.t. Degeneracy
2026
Cited
0
Smaller Circuits for Bit Addition
2025
Cited
0
Simplifier: A New Tool for Boolean Circuit Simplification
2025
Cited
0
Conditional Complexity Hardness: Monotone Circuit Size, Matrix Rigidity, and Tensor Rank Under NSETH and Beyond
2024
Cited
0
Load more
Co-authors
8 total
Sergey Nikolenko
Steklov Institute of Mathematics at St. Petersburg, Russia
Ivan Mihajlin
UCSD
Max A. Alekseyev
George Washington University
Alexander Golovnev
Georgetown University
Fedor V. Fomin
Professor of Computer Science, University of Bergen
Edward A. Hirsch
Full Professor, Department of Computer Science, Ariel University
Marek Cygan
University of Warsaw
Alexander V. Smal
JetBrains Research
