Articoli correlati a Randomness and Completeness in Computational Complexity:...
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti:
1. Introduction.- 2. Preliminaries.- 3. Derandomizing Arthur-Merlin Games.- 4. Sparseness of Complete Languages.- 5. Autoreducibility of Complete Languages.- 6. The Size of Randomized Polynomial Time.- 7. The Frequency of Complete Languages.- 8. The Frequency of Autoreducible Languages.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer
- Data di pubblicazione2009
- ISBN 10 3540414924
- ISBN 13 9783540414926
- RilegaturaCopertina flessibile
- Numero di pagine212
Compra nuovo
Scopri di più su questo articolo
EUR 53,18
Spese di spedizione:
GRATIS
In U.S.A.
I migliori risultati di ricerca su AbeBooks
Immagini fornite dal venditore
Randomness and Completeness in Computational Complexity (Lecture Notes in Computer Science (1950)) by van Melkebeek, Dieter [Paperback ]
Da:
Valutazione libreria
Descrizione libro Soft Cover. Condizione: new. Codice articolo 9783540414926
Compra nuovo
EUR 53,18
Convertire valuta
Foto dell'editore
Randomness and Completeness in Computational Complexity (Lecture Notes in Computer Science, 1950)
Da:
Valutazione libreria
Descrizione libro Condizione: New. Codice articolo ABLIING23Mar3113020166649
Compra nuovo
EUR 56,70
Convertire valuta
Immagini fornite dal venditore
Randomness and Completeness in Computational Complexity
Da:
Valutazione libreria
Descrizione libro Condizione: New. Codice articolo 1705095-n
Compra nuovo
EUR 57,99
Convertire valuta
Foto dell'editore
Randomness and Completeness in Computational Complexity
Print on Demand
Da:
Valutazione libreria
Descrizione libro Condizione: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Codice articolo ria9783540414926_lsuk
Compra nuovo
EUR 59,76
Convertire valuta
Immagini fornite dal venditore
Randomness and Completeness in Computational Complexity
Editore:
Springer Berlin Heidelberg Dez 2000
(2000)
ISBN 10: 3540414924
ISBN 13: 9783540414926
Nuovo
Taschenbuch
Quantità: 2
Da:
Valutazione libreria
Descrizione libro Taschenbuch. Condizione: 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. Codice articolo 9783540414926
Compra nuovo
EUR 53,49
Convertire valuta
Immagini fornite dal venditore
Randomness and Completeness in Computational Complexity
Da:
Valutazione libreria
Descrizione libro Condizione: New. Codice articolo 1705095-n
Compra nuovo
EUR 59,75
Convertire valuta
Foto dell'editore
Randomness and Completeness in Computational Complexity
Da:
Valutazione libreria
Descrizione libro Condizione: New. 2000. 2000th Edition. paperback. . . . . . Codice articolo V9783540414926
Compra nuovo
EUR 75,14
Convertire valuta
Immagini fornite dal venditore
Randomness and Completeness in Computational Complexity
Editore:
Springer Berlin Heidelberg
(2000)
ISBN 10: 3540414924
ISBN 13: 9783540414926
Nuovo
Taschenbuch
Quantità: 1
Da:
Valutazione libreria
Descrizione libro Taschenbuch. Condizione: 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. Codice articolo 9783540414926
Compra nuovo
EUR 56,45
Convertire valuta
Foto dell'editore
Randomness and Completeness in Computational Complexity
Da:
Valutazione libreria
Descrizione libro PF. Condizione: New. Codice articolo 6666-IUK-9783540414926
Compra nuovo
EUR 78,76
Convertire valuta
Immagini fornite dal venditore
Randomness and Completeness in Computational Complexity
Editore:
Springer Berlin Heidelberg
(2000)
ISBN 10: 3540414924
ISBN 13: 9783540414926
Nuovo
Kartoniert / Broschiert
Quantità: > 20
Da:
Valutazione libreria
Descrizione libro Kartoniert / Broschiert. Condizione: 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. Codice articolo 4889290
Compra nuovo
EUR 48,37
Convertire valuta