Author:
Mignon Thierry,Ressayre Nicolas
Publisher
Oxford University Press (OUP)
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Determinants vs. Algebraic Branching Programs;computational complexity;2024-08-31
2. A Lower Bound on Determinantal Complexity;computational complexity;2022-09-19
3. Quadratic Lower Bounds for Algebraic Branching Programs and Formulas;computational complexity;2022-07-05
4. Non-commutative Optimization - Where Algebra, Analysis and Computational Complexity Meet;Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation;2022-07-04
5. A full complexity dichotomy for immanant families;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15