Author:
Fijalkow Nathanaël,Lagarde Guillaume,Ohlmann Pierre,Serre Olivier
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference36 articles.
1. Manindra Agrawal, Rohit Gurjar, Arpita Korwar & Nitin
Saxena (2015). Hitting-Sets for ROABP and Sum of Set-Multilinear
Circuits. SIAM Journal on Computing 44(3), 669–697.
2. Eric Allender, Jia Jiao, Meena Mahajan & V. Vinay (1998).
Non-Commutative Arithmetic Circuits: Depth Reduction and Size
Lower Bounds. Theoretical Computer Science 209(1-2), 47–86.
3. Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay &
S. Raja (2017). Efficient Identity Testing and Polynomial Factorization
in Nonassociative Free Rings. In Proceedings of the 42nd International
Symposium on Mathematical Foundations of Computer Science (MFCS
2017), volume 83 of LIPIcs, 38:1–38:13. Schloss Dagstuhl - Leibniz-
Zentrum fuer Informatik. ISBN 978-3-95977-046-0. ISSN 1868-8969.
4. Vikraman Arvind & S. Raja (2016). Some Lower Bound Results for
Set-Multilinear Arithmetic Computations. Chicago Journal of Theoretical
Computer Science 2016.
5. Walter Baur & Volker Strassen (1983). The Complexity of Partial
Derivatives. Theoretical Computer Science 22, 317–330.