( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Lattice Problems beyond Polynomial Time.

, , , , , , , , и . STOC, стр. 1516-1526. ACM, (2023)

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)
 

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

Families with Infants: A General Approach to Solve Hard Partition Problems., , и . ICALP (1), том 8572 из Lecture Notes in Computer Science, стр. 551-562. Springer, (2014)Gate elimination: Circuit size lower bounds and #SAT upper bounds., , , и . Theor. Comput. Sci., (2018)A note on lower bounds for non-interactive message authentication using weak keys., и . ITW Fall, стр. 249-251. IEEE, (2015)Hilbert Functions and Low-Degree Randomness Extractors., , , , и . Electron. Colloquium Comput. Complex., (2024)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)Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else)., , , и . SODA, стр. 1816-1835. SIAM, (2021)Quantum Worst-Case to Average-Case Reductions for All Linear Problems., , , , и . SODA, стр. 2535-2567. SIAM, (2024)Detecting Patterns Can Be Hard: Circuit Lower Bounds for the String Matching Problem., , и . CoRR, (2017)Solving SCS for bounded length strings in fewer than 2n steps., , и . Inf. Process. Lett., 114 (8): 421-425 (2014)