Author:
Eaves B. Curtis,Rothblum Uriel G.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference22 articles.
1. E. Balas, “Disjunctive programming: properties of the convex hulls of feasible points,” unpublished manuscript, (1974).
2. L. Blum, M. Shub and S. Smale, “On the theory of computation and complexity over the real numbers: NP-completeness recursive functions and universal machines,”Bulletin (New Series) of the American Mathematical Society 21 (1989) 1–46.
3. G. Collins, “Quantifier elimination for real closed fields by cylindrical algebraic decomposition,” in:Lecture Notes in Computer Science 33 (Springer Verlag, New York, 1975) pp. 515–532.
4. B.C. Eaves, “A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set,”Mathematical Programming 14 (1978) 122–124.
5. B.C. Eaves and U.G. Rothblum, “Invariant polynomial curves of piecewise linear maps,”SIAM Journal on Control and Optimization 26 (1988) 401–416.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献