Normal view MARC view ISBD view

On the computational complexity of best Chebyshev approximation I. K. Ko

By:

Series: Preprint. MSRI- 01118-86 Publication details: Berkeley Mathematical Sciences Research Institute 1985Description: 35 p 29 cm

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Carti	IMAR	III 27601 (Browse shelf(Opens below))	Available		0029950

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	III 27598 An approach to communication equilibria	III 27599 Sets with small generalized komogorov complexity	III 27600 A note on one-way functions and polynomial - time isomorphisms	III 27601 On the computational complexity of best Chebyshev approximation	III 27602 An "11" - heuristic for minimum edge length rectangular partitions of rectilinear figures	III 27603 On inefficient special cases of np-complete problems	III 27604 Proper preferences and quasi-concave utility functions	Next

Contine bibliografie

Deasupra titlului: Mathematical Sciences Research Institute

There are no comments on this title.

to post a comment.