( en | de | ru )

 

Disambiguation of "Kulikov, Alexander S."

Author of the publication

copydeleteadd this publication to your clipboard
On the Limits of Gate Elimination.

, , , and . MFCS, volume 58 of LIPIcs, page 46:1-46:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alexander Kulikov

Roman Kulikov

Vladislav Kulikov

Valentin Kulikov

Viacheslav Kulikov

 

Other publications of authors with the same name

Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds., , , , , and . SODA, page 1834-1853. SIAM, (2024)Lower Bounds for Unrestricted Boolean Circuits: Open Problems.. CSR, volume 10846 of Lecture Notes in Computer Science, page 15-22. Springer, (2018)Solving SCS for bounded length strings in fewer than 2n steps., , and . Inf. Process. Lett., 114 (8): 421-425 (2014)Parameterized Complexity of Superstring Problems., , , , , and . Algorithmica, 79 (3): 798-813 (2017)Approximating Shortest Superstring Problem Using de Bruijn Graphs., , and . CPM, volume 7922 of Lecture Notes in Computer Science, page 120-129. Springer, (2013)Greedy Conjecture for Strings of Length 4., , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 307-315. Springer, (2015)An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers., and . MFCS, volume 6907 of Lecture Notes in Computer Science, page 256-265. Springer, (2011)Complexity of Semialgebraic Proofs with Restricted Degree of Falsity., and . SAT, volume 4121 of Lecture Notes in Computer Science, page 11-21. Springer, (2006)Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates., and . Electron. Colloquium Comput. Complex., (2016)A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function., , , and . FOCS, page 89-98. IEEE Computer Society, (2016)