Normal view MARC view ISBD view

On the computational complexity of best Chebyshev approximation

Ko, I. K

On the computational complexity of best Chebyshev approximation I. K. Ko - Berkeley Mathematical Sciences Research Institute 1985 - 35 p 29 cm - Preprint MSRI- 01118-86 .

Contine bibliografie Deasupra titlului: Mathematical Sciences Research Institute

Print
Add to your cart (remove)
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)