Publisher
Springer Berlin Heidelberg
Reference47 articles.
1. M. Aldaz, J. Heintz, G. Matera, J. L. Montaña, and L. M. Pardo. Time-space tradeoffs in algebraic complexity theory. J. Compl., 16:2–49, 2000.
2. A. Alder. Grenzrang und Grenzkomplexität aus algebraischer und topologischer Sicht. PhD thesis, Zürich University, 1984.
3. A. I. Barvinok. Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor. Random Structures and Algorithms, 14:29–61, 1999.
4. W. Baur. Simplified lower bounds for polynomials with algebraic coefficients. J. Compl., 13:38–41, 1997.
5. W. Baur and K. Halupczok. On lower bounds for the complexity of polynomials and their multiples. Comp. Compl., 8:309–315, 1999.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献