( en | de | ru )

 

Disambiguation of "Knop, Alexander"

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 Knop

Martin Knop

Erich Knop

Heinz Knop

Ralph Knop

 

Other publications of authors with the same name

Complexity of Distributions and Average-Case Hardness., , and . ISAAC, volume 64 of LIPIcs, page 38:1-38:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)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)Adversarial Manifold Estimation., and . Found. Comput. Math., 24 (1): 1-97 (February 2024)Hard Satisfiable Formulas for Splittings by Linear Combinations., and . SAT, volume 10491 of Lecture Notes in Computer Science, page 53-61. Springer, (2017)Statistical query complexity of manifold estimation., and . STOC, page 116-122. ACM, (2021)Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs., , and . CSL, volume 152 of LIPIcs, page 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Strategies for Stable Merge Sorting., and . CoRR, (2018)Circuit Lower Bounds for Average-Case MA.. CSR, volume 9139 of Lecture Notes in Computer Science, page 283-295. Springer, (2015)Log-rank and lifting for AND-functions., , , and . STOC, page 197-208. ACM, (2021)