Circuits versus Trees in Algebraic Complexity - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Pascal Koiran. Circuits versus Trees in Algebraic Complexity. In Horst Reichel, Sophie Tison, editors, STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings. Volume 1770 of Lecture Notes in Computer Science, pages 35-52, Springer, 2000. [doi]

This author has not been identified. Look up 'Pascal Koiran' in Google

runs on WebDSL