Author:
Faigle U.,Kern W.,Streng M.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference8 articles.
1. M. Ben-Or, D. Kozen and J. Reif, “The complexity of elementary algebra and geometry,”Journal of Computer and System Sciences 32 (1986) 251–264.
2. Lecture Notes in Computer Science;G.E. Collins,1975
3. P. Gritzmann and V. Klee, “Inner and outer j-radii of convex bodies in finite-dimensional normed spaces,”Discrete Computational Geometry 7 (1992) 255–280.
4. P. Gritzmann and V. Klee, “Computational complexity of inner and outer j-radis of polytopes in finite-dimensional normed spaces,”Mathematical Programming 59 (1993) 163–215.
5. P. Jonker, M. Streng and F. Twilt, “Chebyshev line approximation: a sensitivity analysis,” in: J. Guddat, H.Th. Jongen, B. Kommer and F. Nočička, eds.,Parametric Optimization and Related Topics III, Approximation and Optimization (Peter Lang Verlag, Frankfurt am Main, Berlin, 1993) 303–322.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献