An edition of Computational complexity and feasibility of data processing and interval computations (1997)

Computational complexity and feasibility of data processing and interval computations

by Vladik Kreinovich, V. Kreinovich, A.V. Lakeyev, J. Rohn, and P.T. Kahl

Not in Library

My Reading Lists:

Use this Work

Create a new list

Check nearby libraries

Buy this book

Last edited by ImportBot

February 26, 2022 | History

Edit

An edition of Computational complexity and feasibility of data processing and interval computations (1997)

Computational complexity and feasibility of data processing and interval computations

by Vladik Kreinovich, V. Kreinovich, A.V. Lakeyev, J. Rohn, and P.T. Kahl

The input data for data processing algorithms come from measurements and are hence not precise. We therefore need to estimate the accuracy of the results of data processing. It turns out that even for the simplest data processing algorithms, this problem is, in general, intractable. This book describes for what classes of problems interval computations (i.e. data processing with automatic results verification) are feasible, and when they are intractable. This knowledge is important, e.g. for algorithm developers, because it will enable them to concentrate on the classes of problems for which general algorithms are possible.

Publish Date

1998

Publisher

Kluwer Academic Publishers

Language

English

Pages

459

Check nearby libraries

Buy this book

Previews available in: English

Showing 4 featured editions. View all 4 editions?

Edition	Availability
1 Computational Complexity and Feasibility of Data Processing and Interval Computations 2013, Springer London, Limited in English 1475727933 9781475727937	zzzz Not in Library Libraries near you: WorldCat
2 Computational Complexity and Feasibility of Data Processing and Interval Computations Dec 10, 2010, Springer, Springer US paperback 144194785X 9781441947857	zzzz Not in Library Libraries near you: WorldCat
3 Computational complexity and feasibility of data processing and interval computations 1998, Kluwer Academic Publishers in English 0792348656 9780792348658	aaaa Not in Library Libraries near you: WorldCat
4 Computational Complexity and Feasibility of Data Processing and Interval Computations (Applied Optimization) December 31, 1997, Springer Hardcover in English - 1 edition 0792348656 9780792348658	zzzz Not in Library Libraries near you: WorldCat

Add another edition?

Book Details

Edition Notes

Includes bibliographical references (p. 413-450) and index.

Published in: Dordrecht, Boston
Series: Applied optimization ;, v. 10

Classifications

Dewey Decimal Class: 519.4/0285
Library of Congress: QA267.7 .C68 1998, QA71-90

The Physical Object

Pagination: xii, 459 p. ;
Number of pages: 459

ID Numbers

Open Library: OL695632M
Internet Archive: computationalcom00krei
ISBN 10: 0792348656
LCCN: 97043085
Goodreads: 4618621

Source records

Scriblio MARC record
Library of Congress MARC record
Internet Archive item record
Library of Congress MARC record
Better World Books record

Community Reviews (0)

Feedback?

No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Created April 1, 2008
8 revisions

Download catalog record: RDF / JSON / OPDS | Wikipedia citation

February 26, 2022	Edited by ImportBot	import existing book
November 26, 2020	Edited by MARC Bot	import existing book
June 29, 2019	Edited by MARC Bot	import existing book
February 4, 2019	Edited by MARC Bot	import existing book
April 1, 2008	Created by an anonymous user	Imported from Scriblio MARC record

Computational complexity and feasibility of data processing and interval computations

by Vladik Kreinovich, V. Kreinovich, A.V. Lakeyev, J. Rohn, and P.T. Kahl