Description du livre 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. N� de r�f. du vendeur 9783540414926

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 53,49

Autre devise

Ajouter au panier

Frais de port : EUR 23

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Image d'archives

Randomness and Completeness in Computational Complexity

Melkebeek, Dieter van

Edit� par Springer (2000)

ISBN 10 : 3540414924 ISBN 13 : 9783540414926

Neuf Couverture souple Quantit� disponible : 15

Vendeur :

Kennys Bookshop and Art Galleries Ltd.
(Galway, GY, Irlande)

Evaluation vendeur

Evaluation du vendeur :

Description du livre Etat : New. 2000. 2000th Edition. paperback. . . . . . N� de r�f. du vendeur V9783540414926

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 75,14

Autre devise

Ajouter au panier

Frais de port : EUR 10,50

De Irlande vers Etats-Unis

Destinations, frais et d�lais

Image fournie par le vendeur

Randomness and Completeness in Computational Complexity

Dieter van Melkebeek

Edit� par Springer Berlin Heidelberg (2000)

ISBN 10 : 3540414924 ISBN 13 : 9783540414926

Neuf Taschenbuch Quantit� disponible : 1

Vendeur :

AHA-BUCH GmbH
(Einbeck, Allemagne)

Evaluation vendeur

Evaluation du vendeur :

Description du 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. N� de r�f. du vendeur 9783540414926

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 56,45

Autre devise

Ajouter au panier

Frais de port : EUR 32,99

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Image d'archives

Randomness and Completeness in Computational Complexity

Melkebeek, Dieter van

Edit� par Springer 2000-12 (2000)

ISBN 10 : 3540414924 ISBN 13 : 9783540414926

Neuf PF Quantit� disponible : 10

Vendeur :

Chiron Media
(Wallingford, Royaume-Uni)

Evaluation vendeur

Evaluation du vendeur :

Description du livre PF. Etat : New. N� de r�f. du vendeur 6666-IUK-9783540414926

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 77,78

Autre devise

Ajouter au panier

Frais de port : EUR 17,54

De Royaume-Uni vers Etats-Unis

Destinations, frais et d�lais

Image fournie par le vendeur

Randomness and Completeness in Computational Complexity

Dieter van Melkebeek

Edit� par Springer Berlin Heidelberg (2000)

ISBN 10 : 3540414924 ISBN 13 : 9783540414926

Neuf Kartoniert / Broschiert Quantit� disponible : > 20

impression � la demande

Vendeur :

moluna
(Greven, Allemagne)

Evaluation vendeur

Evaluation du vendeur :

Description du livre 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. N� de r�f. du vendeur 4889290

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 48,37

Autre devise

Ajouter au panier

Frais de port : EUR 48,99

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Image d'archives

Randomness and Completeness in Computational Complexity

Melkebeek, Dieter van

Edit� par Springer (2000)

ISBN 10 : 3540414924 ISBN 13 : 9783540414926

Neuf Couverture souple Quantit� disponible : 15

Vendeur :

Kennys Bookstore
(Olney, MD, Etats-Unis)

Evaluation vendeur

Evaluation du vendeur :

Description du livre Etat : New. 2000. 2000th Edition. paperback. . . . . . Books ship from the US and Ireland. N� de r�f. du vendeur V9783540414926

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 92,94

Autre devise

Ajouter au panier

Frais de port : EUR 9,67

Vers Etats-Unis

Destinations, frais et d�lais

There are autres exemplaires de ce livre sont disponibles

Afficher tous les r�sultats pour ce livre

Articles li�s � Randomness and Completeness in Computational Complexity

Randomness and Completeness in Computational Complexity - Couverture souple

Acheter neuf

Meilleurs r�sultats de recherche sur AbeBooks

There are autres exemplaires de ce livre sont disponibles