Skip to main content

University of Minnesota / Driven to DiscoverUniversity of Minnesota

Libraries

View Item 
Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces
Gritzmann, Peter; Klee, Victor (1990)
Thumbnail
View/Download file
Persistent link to this item
http://hdl.handle.net/11299/1438
Services
Title
Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces
Authors
Issue Date
1990-09
Appears in collections
IMA Preprints Series [2486]
Identifiers
704
Related to
Institute for Mathematics and Its Applications>IMA Preprints Series
Suggested Citation
Gritzmann, Peter; Klee, Victor. (1990). Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Retrieved from the University of Minnesota Digital Conservancy, http://hdl.handle.net/11299/1438.
Content distributed via the University of Minnesota's Digital Conservancy may be subject to additional license and use restrictions applied by the depositor.