( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits.

, и . Electron. Colloquium Comput. Complex., (2017)

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.

Ben Schöttker

Ben Novak

Ben Schmehe

Ben Schacher

Ben Schloesser

 

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

SIGACT News Complexity Theory Column 121.. SIGACT News, (июня 2024)Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits., , , и . Electron. Colloquium Comput. Complex., (2024)Tensor Reconstruction Beyond Constant Rank., , и . ITCS, том 287 из LIPIcs, стр. 87:1-87:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits., и . Electron. Colloquium Comput. Complex., (2020)An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits., и . Electron. Colloquium Comput. Complex., (2017)Lower Bounds on Stabilizer Rank., , и . CoRR, (2021)Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs., , , , и . CCC, том 50 из LIPIcs, стр. 30:1-30:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Succinct hitting sets and barriers to proving algebraic circuits lower bounds., , и . STOC, стр. 653-664. ACM, (2017)On the structure of boolean functions with small spectral norm., , и . ITCS, стр. 37-48. ACM, (2014)A Lower Bound on Determinantal Complexity., и . CCC, том 200 из LIPIcs, стр. 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)