( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
AC0p Lower Bounds Against MCSP via the Coin Problem.

, , , , , и . ICALP, том 132 из LIPIcs, стр. 66:1-66:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Anatoly Golovnev

Alexander

Alexander Auch

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

Alexander Stadler

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

Alexander Gocht

Methods in economic farm modelling. Uni Bonn, (2009)
 

Другие публикации лиц с тем же именем

Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else)., , , и . CoRR, (2019)Gate elimination: Circuit size lower bounds and #SAT upper bounds., , , и . Theor. Comput. Sci., (2018)Families with Infants: A General Approach to Solve Hard Partition Problems., , и . ICALP (1), том 8572 из Lecture Notes in Computer Science, стр. 551-562. Springer, (2014)A note on lower bounds for non-interactive message authentication using weak keys., и . ITW Fall, стр. 249-251. IEEE, (2015)Improving 3N Circuit Complexity Lower Bounds., , , и . Comput. Complex., 32 (2): 13 (декабря 2023)On the limits of gate elimination., , , и . J. Comput. Syst. Sci., (2018)Collapsing Superstring Conjecture., , , и . CoRR, (2018)Classification of the streaming approximability of Boolean CSPs., , , и . CoRR, (2021)String Matching: Communication, Circuits, and Learning., , , и . APPROX-RANDOM, том 145 из LIPIcs, стр. 56:1-56:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Circuit Depth Reductions., , и . ITCS, том 185 из LIPIcs, стр. 24:1-24:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)