Author of the publication

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials III: Actions by Classical Groups.

, , , , and . ITCS, volume 287 of LIPIcs, page 31:1-31:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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.

 

Other publications of authors with the same name

General Linear Group Action on Tensors: A Candidate for Post-quantum Cryptography., , , and . TCC (1), volume 11891 of Lecture Notes in Computer Science, page 251-281. Springer, (2019)Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs., , and . FSTTCS, volume 8 of LIPIcs, page 296-307. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Sparse multivariate polynomial interpolation on the basis of Schubert polynomials., and . Comput. Complex., 26 (4): 881-909 (2017)On the complexity of trial and error for constraint satisfaction problems., , , , and . Electron. Colloquium Comput. Complex., (2014)Generalized Wong sequences and their applications to Edmonds' problems., , , and . J. Comput. Syst. Sci., 81 (7): 1373-1386 (2015)Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms., , and . STACS, volume 187 of LIPIcs, page 38:1-38:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms., , , , , and . EUROCRYPT (3), volume 13277 of Lecture Notes in Computer Science, page 582-612. Springer, (2022)Code Equivalence and Group Isomorphism., , , and . SODA, page 1395-1408. SIAM, (2011)On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials III: Actions by Classical Groups., , , , and . ITCS, volume 287 of LIPIcs, page 31:1-31:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time., , and . ITCS, volume 67 of LIPIcs, page 55:1-55:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)