Constructive real analysis von goldstein a a (11 Ergebnisse)

Hardcover. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Zustand: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings. In good all round condition. Dust jacket in good condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,600grams, ISBN.

Zustand: Gebraucht / Used. Hardcover. Very good. Xii,178pp.

Hardcover. Zustand: Gut. N.Y., Harper & Row (1967). XII, 178 p. OCloth. Harper's Series in Modern Mathematics.- With exercises.- Name on flyleaf, otherwise in good condition.

Zustand: Gebraucht / Used. Hardcover. Good. Xii,178pp.

Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,600grams, ISBN.

Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,600grams, ISBN.

Kartoniert / Broschiert. Zustand: New. InhaltsverzeichnisrnrnPrefacen I. Roots and Extremal Problemsn A. Iterations and Fixed Pointsn B. Metric Spacesn C. Miscellanyn D. Gradient Techniquesn n II. Constraintsn A. Nonlinear Programmingn B. Polyhedral Convex Programmingn C. .