Artículos relacionados a Randomness and Completeness in Computational Complexity:...

Randomness and Completeness in Computational Complexity: 1950 (Lecture Notes in Computer Science) - Tapa blanda

 
9783540414926: Randomness and Completeness in Computational Complexity: 1950 (Lecture Notes in Computer Science)

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

Reseña del editor

This book is based on the author's Ph.D. thesis which was selected as the winning thesis of the 1999 ACM Doctoral Dissertation Competition. Dieter van Melkebeek did his Ph.D. work at the University of Chicago with Lance Fortnow as thesis advisor. This work studies some central issues in computational complexity: the relative power of time, space, and randomness in computing and verification. The author develops techniques for separating complexity classes by isolating structural differences between their complete problems. He presents several approaches based on such diverse concepts as density, redundancy, and frequency of occurrence.

"Sobre este título" puede pertenecer a otra edición de este libro.

  • EditorialSpringer
  • Año de publicación2009
  • ISBN 10 3540414924
  • ISBN 13 9783540414926
  • EncuadernaciónTapa blanda
  • IdiomaInglés
  • Número de páginas212
  • Contacto del fabricanteno disponible

Comprar usado

Condición: Aceptable
xv, 196pp. ill. 24 cm. Revision...
Ver este artículo

EUR 21,36 gastos de envío desde Reino Unido a España

Destinos, gastos y plazos de envío

Comprar nuevo

Ver este artículo

EUR 11,00 gastos de envío desde Alemania a España

Destinos, gastos y plazos de envío

Resultados de la búsqueda para Randomness and Completeness in Computational Complexity:...

Imagen de archivo

Dieter van Melkebeek
Publicado por Springer, 2000
ISBN 10: 3540414924 ISBN 13: 9783540414926
Antiguo o usado PaperBack

Librería: Richard Booth's Bookshop, Hereford, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

PaperBack. Condición: 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. Nº de ref. del artículo: 100073243

Contactar al vendedor

Comprar usado

EUR 12,22
Convertir moneda
Gastos de envío: EUR 21,36
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito

Imagen del vendedor

Dieter van Melkebeek
ISBN 10: 3540414924 ISBN 13: 9783540414926
Nuevo Taschenbuch
Impresión bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Taschenbuch. Condición: 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 ref. del artículo: 9783540414926

Contactar al vendedor

Comprar nuevo

EUR 53,49
Convertir moneda
Gastos de envío: EUR 11,00
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Imagen del vendedor

Dieter van Melkebeek
Publicado por Springer Berlin Heidelberg, 2000
ISBN 10: 3540414924 ISBN 13: 9783540414926
Nuevo Taschenbuch

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Taschenbuch. Condición: 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 ref. del artículo: 9783540414926

Contactar al vendedor

Comprar nuevo

EUR 53,49
Convertir moneda
Gastos de envío: EUR 11,99
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito

Imagen de archivo

Melkebeek, Dieter Van
Publicado por Springer, 2000
ISBN 10: 3540414924 ISBN 13: 9783540414926
Nuevo Tapa blanda

Librería: Ria Christie Collections, Uxbridge, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. In. Nº de ref. del artículo: ria9783540414926_new

Contactar al vendedor

Comprar nuevo

EUR 62,12
Convertir moneda
Gastos de envío: EUR 4,72
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Dieter van Melkebeek
Publicado por Springer Berlin Heidelberg, 2000
ISBN 10: 3540414924 ISBN 13: 9783540414926
Nuevo Tapa blanda
Impresión bajo demanda

Librería: moluna, Greven, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: 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 ref. del artículo: 4889290

Contactar al vendedor

Comprar nuevo

EUR 48,37
Convertir moneda
Gastos de envío: EUR 19,49
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Melkebeek, Dieter Van
Publicado por Springer, 2000
ISBN 10: 3540414924 ISBN 13: 9783540414926
Nuevo Tapa blanda

Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. Nº de ref. del artículo: 1705095-n

Contactar al vendedor

Comprar nuevo

EUR 54,63
Convertir moneda
Gastos de envío: EUR 17,52
De Estados Unidos de America a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Melkebeek, Dieter Van
Publicado por Springer, 2000
ISBN 10: 3540414924 ISBN 13: 9783540414926
Nuevo Tapa blanda

Librería: GreatBookPricesUK, Woodford Green, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. Nº de ref. del artículo: 1705095-n

Contactar al vendedor

Comprar nuevo

EUR 62,10
Convertir moneda
Gastos de envío: EUR 17,80
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Dieter van Melkebeek
ISBN 10: 3540414924 ISBN 13: 9783540414926
Nuevo Taschenbuch

Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540414926

Contactar al vendedor

Comprar nuevo

EUR 53,49
Convertir moneda
Gastos de envío: EUR 35,00
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Imagen de archivo

Dieter van Melkebeek
Publicado por Springer, 2000
ISBN 10: 3540414924 ISBN 13: 9783540414926
Nuevo Tapa blanda

Librería: Books Puddle, New York, NY, Estados Unidos de America

Calificación del vendedor: 4 de 5 estrellas Valoración 4 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. pp. 220. Nº de ref. del artículo: 263096025

Contactar al vendedor

Comprar nuevo

EUR 80,93
Convertir moneda
Gastos de envío: EUR 10,08
De Estados Unidos de America a España
Destinos, gastos y plazos de envío

Cantidad disponible: 4 disponibles

Añadir al carrito

Imagen de archivo

Melkebeek Dieter van
Publicado por Springer, 2000
ISBN 10: 3540414924 ISBN 13: 9783540414926
Nuevo Tapa blanda
Impresión bajo demanda

Librería: Majestic Books, Hounslow, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. Print on Demand pp. 220 Illus. Nº de ref. del artículo: 5800454

Contactar al vendedor

Comprar nuevo

EUR 81,55
Convertir moneda
Gastos de envío: EUR 10,50
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: 4 disponibles

Añadir al carrito

Existen otras 6 copia(s) de este libro

Ver todos los resultados de su búsqueda