Seller: Richard Booth's Bookshop, Hereford, United Kingdom
PaperBack. Condition: Good. No jacket. xv, 196pp. ill. 24 cm. Revision of thesis Ph. D.University of Chicago, 1999.Includes bibliographical references p. 183189 and indexes.Good Clean Copy.This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1999 ACM Doctoral Dissertation Award in May 2000. Summary Computational complexity is the study of the inherent di culty of compu tional problems and the power of the tools we may use to solve them. It aims to describe how many resources we need to compute the solution as a function of the problem size. Typical resources include time on sequential and parallel architectures and memory space. As we want to abstract away from details of input representation and speci cs of the computer model, we end up with classes of problems that we can solve within certain robust resource bounds such as polynomial time, parallel logarithmic time, and logarithmic space. Research in complexity theory boils down to determining the relationships between these classes inclusions and separations. In this dissertation, we focus on the role of randomness and look at various properties of hard problems in order to obtain separations. We also investigate the power of nondeterminism and alternation, as well as space versus time issues. Randomness provides a resource that seems to help in various situations.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.82
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 50.81
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Published by Springer Berlin Heidelberg, 2000
ISBN 10: 3540414924 ISBN 13: 9783540414926
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
£ 46.73
Convert currencyQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1999 ACM Doctoral Dissertation Award in May 2000. Summary Computational complexity is the study of the inherent di culty of compu- tional problems and the power of the tools we may use to solve them. It aims to describe how many resources we need to compute the solution as a function of the problem size. Typical resources include time on sequential and parallel architectures and memory space. As we want to abstract away from details of input representation and speci cs of the computer model, we end up with classes of problems that we can solve within certain robust resource bounds such as polynomial time, parallel logarithmic time, and logarithmic space. Research in complexity theory boils down to determining the relationships between these classes { inclusions and separations. In this dissertation, we focus on the role of randomness and look at various properties of hard problems in order to obtain separations. We also investigate the power of nondeterminism and alternation, as well as space versus time issues. Randomness provides a resource that seems to help in various situations.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
£ 45.93
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
£ 68.05
Convert currencyQuantity: 4 available
Add to basketCondition: New. pp. 220.
Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2000, 2000
ISBN 10: 3540414924 ISBN 13: 9783540414926
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
£ 46.73
Convert currencyQuantity: 2 available
Add to basketTaschenbuch. Condition: Neu. Neuware -This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1999 ACM Doctoral Dissertation Award in May 2000. Summary Computational complexity is the study of the inherent di culty of compu- tional problems and the power of the tools we may use to solve them. It aims to describe how many resources we need to compute the solution as a function of the problem size. Typical resources include time on sequential and parallel architectures and memory space. As we want to abstract away from details of input representation and speci cs of the computer model, we end up with classes of problems that we can solve within certain robust resource bounds such as polynomial time, parallel logarithmic time, and logarithmic space. Research in complexity theory boils down to determining the relationships between these classes { inclusions and separations. In this dissertation, we focus on the role of randomness and look at various properties of hard problems in order to obtain separations. We also investigate the power of nondeterminism and alternation, as well as space versus time issues. Randomness provides a resource that seems to help in various situations.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 220 pp. Englisch.
Seller: dsmbooks, Liverpool, United Kingdom
Paperback. Condition: Like New. Like New. book.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 93.16
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
£ 44.91
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
£ 107.90
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Published by Springer Berlin Heidelberg Dez 2000, 2000
ISBN 10: 3540414924 ISBN 13: 9783540414926
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
£ 46.73
Convert currencyQuantity: 2 available
Add to basketTaschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1999 ACM Doctoral Dissertation Award in May 2000. Summary Computational complexity is the study of the inherent di culty of compu- tional problems and the power of the tools we may use to solve them. It aims to describe how many resources we need to compute the solution as a function of the problem size. Typical resources include time on sequential and parallel architectures and memory space. As we want to abstract away from details of input representation and speci cs of the computer model, we end up with classes of problems that we can solve within certain robust resource bounds such as polynomial time, parallel logarithmic time, and logarithmic space. Research in complexity theory boils down to determining the relationships between these classes { inclusions and separations. In this dissertation, we focus on the role of randomness and look at various properties of hard problems in order to obtain separations. We also investigate the power of nondeterminism and alternation, as well as space versus time issues. Randomness provides a resource that seems to help in various situations. 220 pp. Englisch.
Published by Springer Berlin Heidelberg, 2000
ISBN 10: 3540414924 ISBN 13: 9783540414926
Language: English
Seller: moluna, Greven, Germany
£ 42.26
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree.
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 220 Illus.
Seller: Biblios, Frankfurt am main, HESSE, Germany
£ 74.01
Convert currencyQuantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND pp. 220.