Alexander S. Kulikov

research fellow in Laboratory of Mathematical Logic of
St. Petersburg Department of Steklov Institute of Mathematics


I graduated from St. Petersburg State University in 2005 and received my Ph.D. from St. Petersburg Department of Steklov Mathematical Institute in 2009 under the supervision of Edward A. Hirsch. My main research interests are algorithms for NP-hard problems and circuit complexity, most of my publications are in these fields. I'm running the Computer Science club and Computer Science center that provide students of St. Petersburg with advanced computer science lectures. I teach courses and run seminars on algorithms and circuit complexity and from time to time organize computer science conferences and student schools in Russia.



Recent publications

Draft DOI Preprint
Alexander Golovnev, Alexander S. Kulikov. Weighted Gate Elimination: Boolean Dispersers for Quadratic Varieties Imply Improved Circuit Lower Bounds.
ITCS 2016.
Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socała. Tight Bounds for Graph Homomorphism and Subgraph Isomorphism.
SODA 2016.
pdf DOI arXiv
Magnus Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov. A better-than-3n lower bound for the circuit complexity of an explicit function