{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T01:29:19Z","timestamp":1673227759752},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1007\/bf02592095","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:55:46Z","timestamp":1175183746000},"page":"1-5","source":"Crossref","is-referenced-by-count":4,"title":["Note on the computational complexity ofj-radii of polytopes in \u211d n"],"prefix":"10.1007","volume":"73","author":[{"given":"U.","family":"Faigle","sequence":"first","affiliation":[]},{"given":"W.","family":"Kern","sequence":"additional","affiliation":[]},{"given":"M.","family":"Streng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02592095_CR1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0022-0000(86)90029-2","volume":"32","author":"M. Ben-Or","year":"1986","unstructured":"M. Ben-Or, D. Kozen and J. Reif, \u201cThe complexity of elementary algebra and geometry,\u201dJournal of Computer and System Sciences 32 (1986) 251\u2013264.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02592095_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume-title":"Automata Theory and Formal Languages","author":"G.E. Collins","year":"1975","unstructured":"G.E. Collins, \u201cQuantifier elimination for real closed fields by cylindric algebraic decomposition,\u201d in: H. Brakhage, ed.,Automata Theory and Formal Languages, Lecture Notes in Computer Science 33 Springer, Berlin, 1975) pp. 134\u2013183."},{"key":"BF02592095_CR3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02187841","volume":"7","author":"P. Gritzmann","year":"1992","unstructured":"P. Gritzmann and V. Klee, \u201cInner and outer j-radii of convex bodies in finite-dimensional normed spaces,\u201dDiscrete Computational Geometry 7 (1992) 255\u2013280.","journal-title":"Discrete Computational Geometry"},{"key":"BF02592095_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01581243","volume":"59","author":"P. Gritzmann","year":"1993","unstructured":"P. Gritzmann and V. Klee, \u201cComputational complexity of inner and outer j-radis of polytopes in finite-dimensional normed spaces,\u201dMathematical Programming 59 (1993) 163\u2013215.","journal-title":"Mathematical Programming"},{"key":"BF02592095_CR5","first-page":"303","volume-title":"Parametric Optimization and Related Topics III, Approximation and Optimization","author":"P. Jonker","year":"1993","unstructured":"P. Jonker, M. Streng and F. Twilt, \u201cChebyshev line approximation: a sensitivity analysis,\u201d in: J. Guddat, H.Th. Jongen, B. Kommer and F. No\u010di\u010dka, eds.,Parametric Optimization and Related Topics III, Approximation and Optimization (Peter Lang Verlag, Frankfurt am Main, Berlin, 1993) 303\u2013322."},{"key":"BF02592095_CR6","unstructured":"M. Streng, \u201cChebyshev approximation of finite sets by curves and linear manifolds,\u201d Ph.D. Thesis, University of Twente (1993)."},{"key":"BF02592095_CR7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01263063","volume":"10","author":"M. Streng","year":"1994","unstructured":"M. Streng and W. Wetterling, \u201cChebyshev approximation of a point set by a straight line,\u201dConstructive Approximation 10 (1994) 187\u2013196.","journal-title":"Constructive Approximation"},{"key":"BF02592095_CR8","first-page":"1951","volume-title":"A Decision Method for Elementary Algebra and Geometry","author":"A. Tarski","year":"1948","unstructured":"A. Tarski,A Decision Method for Elementary Algebra and Geometry (University of California Press, Berkeley, CA, 1948, 2nd ed. 1951).","edition":"2nd ed."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592095.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592095\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:52Z","timestamp":1558395472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["BF02592095"],"URL":"https:\/\/doi.org\/10.1007\/bf02592095","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}