Author:
Mulmuley Ketan,Shah Pradyut
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference22 articles.
1. Lower bounds for algebraic computation tress;Ben-Or,1983
2. M. Ben-Or, E. Feig, D. Kozen, and P. Tiwari, A fast parallel algorithm for determining all roots of a polynomial with real roots, in Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, Berkeley, California, 28–30 May 1986, pp. 340–349.
3. Complexity of some parametric integer and network programming problems;Carstensen;Math. Programming,1983
4. The Complexity of Some Problems in Parametric Linear and Combinatorial Programming;Carstensen,1983
5. Parametric cost shortest chain problem;Carstensen,1987
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献