( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Limits of Gate Elimination.

, , , и . MFCS, том 58 из LIPIcs, стр. 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.

Alexander Knop

Caroline Knop

Gerhard Knop

Walter Knop

Heinz Knop

 

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

The Diptych of Communication Complexity Classes in the Best-partition Model and the Fixed-partition Model.. Electron. Colloquium Comput. Complex., (2018)Circuit Lower Bounds for Heuristic MA.. Electron. Colloquium Comput. Complex., (2013)Complexity of Distributions and Average-Case Hardness., , и . ISAAC, том 64 из LIPIcs, стр. 38:1-38:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Adversarial Manifold Estimation., и . Found. Comput. Math., 24 (1): 1-97 (февраля 2024)Hard Satisfiable Formulas for Splittings by Linear Combinations., и . SAT, том 10491 из Lecture Notes in Computer Science, стр. 53-61. Springer, (2017)Statistical query complexity of manifold estimation., и . STOC, стр. 116-122. ACM, (2021)Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs., , и . CSL, том 152 из LIPIcs, стр. 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Strategies for Stable Merge Sorting., и . CoRR, (2018)Circuit Lower Bounds for Average-Case MA.. CSR, том 9139 из Lecture Notes in Computer Science, стр. 283-295. Springer, (2015)Log-rank and lifting for AND-functions., , , и . STOC, стр. 197-208. ACM, (2021)