Type d'article
Etat
Reliure
Particularités
Livraison gratuite
Pays
Evaluation du vendeur
Edité par Now Publishers Inc, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : booksXpress, Bayonne, NJ, Etats-Unis
Livre impression à la demande
Soft Cover. Etat : new. This item is printed on demand.
Edité par Springer, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : ThriftBooks-Atlanta, AUSTELL, GA, Etats-Unis
Livre
Paperback. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 0.69.
Edité par Springer, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : Richard Booth's Bookshop, Hereford, Royaume-Uni
Livre
PaperBack. Etat : 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.
Edité par Springer, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : booksXpress, Bayonne, NJ, Etats-Unis
Livre
Soft Cover. Etat : new.
Edité par Springer, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Livre
Etat : New.
Edité par Springer, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Livre
Etat : New.
Edité par Springer, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Livre impression à la demande
Etat : New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Edité par Now Publishers, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Livre
Etat : New.
Edité par Now Publishers, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Livre
Etat : New.
Edité par Springer Berlin Heidelberg Dez 2000, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Livre impression à la demande
Taschenbuch. Etat : 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.
Edité par Now Publishers, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Livre impression à la demande
PAP. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Edité par Springer, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : GreatBookPricesUK, Castle Donington, DERBY, Royaume-Uni
Livre
Etat : New.
Edité par Now Publishers Inc, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : JEANCOBOOKS, Levittown, NY, Etats-Unis
Livre
Paperback. Etat : As New. EXCELLENT CONDITION - No markings. The binding and pages are tight and clean. Very small 1/16" corner crease.
Edité par Now Publishers, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Livre
Etat : As New. Unread book in perfect condition.
Edité par Now Publishers Inc, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Livre impression à la demande
Etat : New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Edité par Now Publishers Inc 2007-10, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Livre
PF. Etat : New.
Edité par Springer, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Livre
Etat : New. 2000. 2000th Edition. paperback. . . . . .
Edité par Now Publishers, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : GreatBookPricesUK, Castle Donington, DERBY, Royaume-Uni
Livre
Etat : New.
Edité par Now Pub, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Livre
Paperback. Etat : Brand New. 114 pages. 8.95x5.95x0.25 inches. In Stock.
Edité par Springer Berlin Heidelberg, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Livre
Taschenbuch. Etat : 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.
Edité par Springer 2000-12, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Livre
PF. Etat : New.
Edité par Springer Berlin Heidelberg, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : moluna, Greven, Allemagne
Livre impression à la demande
Kartoniert / Broschiert. Etat : 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.
Edité par now publishers Inc, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Livre impression à la demande
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Edité par Springer, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Livre
Etat : New. 2000. 2000th Edition. paperback. . . . . . Books ship from the US and Ireland.
Edité par Now Publishers, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Livre impression à la demande
PAP. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Edité par Now Publishers, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : GreatBookPricesUK, Castle Donington, DERBY, Royaume-Uni
Livre
Etat : As New. Unread book in perfect condition.
Edité par Springer, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : dsmbooks, Liverpool, Royaume-Uni
Livre
Paperback. Etat : Like New. Like New. book.
Edité par Springer, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Livre
Etat : As New. Unread book in perfect condition.
Edité par Springer, 2000
ISBN 10 : 3540414924ISBN 13 : 9783540414926
Vendeur : GreatBookPricesUK, Castle Donington, DERBY, Royaume-Uni
Livre
Etat : As New. Unread book in perfect condition.
Edité par Now Publishers Inc, 2007
ISBN 10 : 1601980841ISBN 13 : 9781601980847
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Livre impression à la demande
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - NP-completeness arguably forms the most pervasive concept from computer science as it captures the computational complexity of thousands of important problems from all branches of science and engineering. The P versus NP question asks whether these problems can be solved in polynomial time. A negative answer has been widely conjectured for a long time but, until recently, no concrete lower bounds were known on general models of computation.Satisfiability is the problem of deciding whether a given Boolean formula has at least one satisfying assignment. It is the first problem that was shown to be NP-complete, and is possibly the most commonly studied NP-complete problem, both for its theoretical properties and its applications in practice.A Survey of Lower Bounds for Satisfiability and Related Problems surveys the recently discovered lower bounds for the time and space complexity of satisfiability and closely related problems. It overviews the state-of-the-art results on general deterministic, randomized, and quantum models of computation, and presents the underlying arguments in a unified framework.A Survey of Lower Bounds for Satisfiability and Related Problems is an invaluable reference for professors and students doing research in complexity theory, or planning to do so.