Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference16 articles.
1. Aho, A., Hopcroft, J., and Ullman, J.,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. Bajaj, C., Limitations to Algorithmic Solvability: Galois Methods and Models of Computation,Proc. ACM Symposium on Symbolic and Algebraic Computation, SYMSAC 86, 1986, pp. 71–76.
3. Bajaj, C., Geometric Optimization and the Polynomial Hierarchy,Theoretical Computer Science,54, 1987, 87–102.
4. Bajaj, C., The Algebraic Degree of Geometric Optimization Problems,Discrete and Computational Geometry,3, 1988, 177–191.
5. Beckenbach, E., and Bellman, R.,An Introduction to Inequalities, Random House, New York, 1961.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献