( en | de | ru )

 

Disambiguation of "Golovnev, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function.

, , , and . FOCS, page 89-98. IEEE Computer Society, (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.

Anatoly Golovnev

Alexander

Alexander Stadler

Messtechnische Bestimmung und Simulation der Kernverluste in weichmagnetischen Materialien. Uni Erlangen-Nürnberg, (2009)

Alexander Auch

A phylogenetic potpourri: computational methods for analysing genome scale data. Uni Tübingen, (2010)

Alexander Blecken

A reference task model for supply chain processes of humanitarian organisations. Uni Paderborn, (2009)
 

Other publications of authors with the same name

Families with Infants: A General Approach to Solve Hard Partition Problems., , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 551-562. Springer, (2014)Gate elimination: Circuit size lower bounds and #SAT upper bounds., , , and . Theor. Comput. Sci., (2018)A note on lower bounds for non-interactive message authentication using weak keys., and . ITW Fall, page 249-251. IEEE, (2015)String Matching: Communication, Circuits, and Learning., , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 56:1-56:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Circuit Depth Reductions., , and . ITCS, volume 185 of LIPIcs, page 24:1-24:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Hilbert Functions and Low-Degree Randomness Extractors., , , , and . APPROX/RANDOM, volume 317 of LIPIcs, page 41:1-41:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Approximating Shortest Superstring Problem Using de Bruijn Graphs., , and . CPM, volume 7922 of Lecture Notes in Computer Science, page 120-129. Springer, (2013)Solving SCS for bounded length strings in fewer than 2n steps., , and . Inf. Process. Lett., 114 (8): 421-425 (2014)The Minrank of Random Graphs., , and . IEEE Trans. Inf. Theory, 64 (11): 6990-6995 (2018)Circuit Complexity: New Techniques and Their Limitations.. New York University, USA, (2017)