From post

Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings.

, , , , , и . CCC, том 169 из LIPIcs, стр. 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

 

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

The geometry of rank decompositions of matrix multiplication II: 3×3 matrices., , , и . CoRR, (2018)Rectangular Kronecker coefficients and plethysms in geometric complexity theory., и . CoRR, (2015)Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings., , , , , и . CCC, том 169 из LIPIcs, стр. 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Computational Complexity of Plethysm Coefficients., и . CoRR, (2020)Positivity of the symmetric group characters is as hard as the polynomial time hierarchy., , и . CoRR, (2022)On the complexity of the permanent in various computational models., и . CoRR, (2016)Homogeneous Algebraic Complexity Theory and Algebraic Formulas., , , , и . ITCS, том 287 из LIPIcs, стр. 43:1-43:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On the Complexity of Evaluating Highest Weight Vectors., , и . CCC, том 200 из LIPIcs, стр. 29:1-29:36. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Implementing geometric complexity theory: on the separation of orbit closures via symmetries., и . STOC, стр. 713-726. ACM, (2020)Degree-Restricted Strength Decompositions and Algebraic Branching Programs., , , и . FSTTCS, том 250 из LIPIcs, стр. 20:1-20:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)