Computational Complexity Theory (IAS/Park City Mathematics Series)

0 valoración promedio
( 0 valoraciones por Goodreads )
 
9780821828724: Computational Complexity Theory (IAS/Park City Mathematics Series)
Ver todas las copias de esta edición ISBN.
 
 

Book by Steven Rudich and Avi Wigderson

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

Críticas:

oThis book contains well written accounts of many branches of complexity theory. aIn particular, any CS grad student doing theory, or any math grad student, should be able to read this book. aThis book would be a good way to learn a lot of complexity theory quickly.o -- Mathematical Reviews

Reseña del editor:

Computational complexity theory is a major research area in mathematics and computer science, the goal of which is to set the formal mathematical foundations for efficient computation. There has been significant development in the nature and scope of the field in the last thirty years. It has evolved to encompass a broad variety of computational tasks by a diverse set of computational models, such as randomized, interactive, distributed, and parallel computations. These models can include many computers, which may behave cooperatively or adversarially. Each summer the IAS/Park City Mathematics Institute Graduate Summer School gathers some of the best researchers and educators in the field to present diverse sets of lectures. This volume presents three weeks of lectures given at the Summer School on Computational Complexity Theory. Topics are structured as follows: Week One: Complexity Theory: From Godel to Feynman. This section of the book gives a general introduction to the field, with the main set of lectures describing basic models, techniques, results, and open problems. Week Two: Lower Bounds on Concrete Models. Topics discussed in this section include communication and circuit complexity, arithmetic and algebraic complexity, and proof complexity. Week Three: Randomness in Computation. Lectures are devoted to different notions of pseudorandomness, interactive proof systems and zero knowledge, and probabilistically checkable proofs (PCPs). The volume is recommended for independent study and is suitable for graduate students and researchers interested in computational complexity. Information for our distributors: Members of the Mathematical Association of America (MAA) and the National Council of Teachers of Mathematics (NCTM) receive a 20% discount from list price.

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

Los mejores resultados en AbeBooks

1.

ISBN 10: 082182872X ISBN 13: 9780821828724
Nuevo Cantidad disponible: 1
Librería
BWB
(Valley Stream, NY, Estados Unidos de America)
Valoración
[?]

Descripción Condición: New. Depending on your location, this item may ship from the US or UK. Nº de ref. del artículo: 97808218287240000000

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 72,74
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Estados Unidos de America a España
Destinos, gastos y plazos de envío

2.

Publicado por American Mathematical Society, United States (2004)
ISBN 10: 082182872X ISBN 13: 9780821828724
Nuevo Tapa dura Cantidad disponible: 1
Librería
Book Depository International
(London, Reino Unido)
Valoración
[?]

Descripción American Mathematical Society, United States, 2004. Hardback. Condición: New. Language: English . Brand New Book. Computational complexity theory is a major research area in mathematics and computer science, the goal of which is to set the formal mathematical foundations for efficient computation. There has been significant development in the nature and scope of the field in the last thirty years. It has evolved to encompass a broad variety of computational tasks by a diverse set of computational models, such as randomized, interactive, distributed, and parallel computations. These models can include many computers, which may behave cooperatively or adversarially. Each summer the IAS/Park City Mathematics Institute Graduate Summer School gathers some of the best researchers and educators in the field to present diverse sets of lectures. This volume presents three weeks of lectures given at the Summer School on Computational Complexity Theory. Topics are structured as follows: Week One: Complexity Theory: From Godel to Feynman. This section of the book gives a general introduction to the field, with the main set of lectures describing basic models, techniques, results, and open problems. Week Two: Lower Bounds on Concrete Models. Topics discussed in this section include communication and circuit complexity, arithmetic and algebraic complexity, and proof complexity. Week Three: Randomness in Computation. Lectures are devoted to different notions of pseudorandomness, interactive proof systems and zero knowledge, and probabilistically checkable proofs (PCPs). The volume is recommended for independent study and is suitable for graduate students and researchers interested in computational complexity. Information for our distributors: Members of the Mathematical Association of America (MAA) and the National Council of Teachers of Mathematics (NCTM) receive a 20 discount from list price. Nº de ref. del artículo: AAN9780821828724

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 75,63
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Reino Unido a España
Destinos, gastos y plazos de envío

3.

Publicado por American Mathematical Society, United States (2004)
ISBN 10: 082182872X ISBN 13: 9780821828724
Nuevo Tapa dura Cantidad disponible: 1
Librería
The Book Depository
(London, Reino Unido)
Valoración
[?]

Descripción American Mathematical Society, United States, 2004. Hardback. Condición: New. Language: English . Brand New Book. Computational complexity theory is a major research area in mathematics and computer science, the goal of which is to set the formal mathematical foundations for efficient computation. There has been significant development in the nature and scope of the field in the last thirty years. It has evolved to encompass a broad variety of computational tasks by a diverse set of computational models, such as randomized, interactive, distributed, and parallel computations. These models can include many computers, which may behave cooperatively or adversarially. Each summer the IAS/Park City Mathematics Institute Graduate Summer School gathers some of the best researchers and educators in the field to present diverse sets of lectures. This volume presents three weeks of lectures given at the Summer School on Computational Complexity Theory. Topics are structured as follows: Week One: Complexity Theory: From Godel to Feynman. This section of the book gives a general introduction to the field, with the main set of lectures describing basic models, techniques, results, and open problems. Week Two: Lower Bounds on Concrete Models. Topics discussed in this section include communication and circuit complexity, arithmetic and algebraic complexity, and proof complexity. Week Three: Randomness in Computation. Lectures are devoted to different notions of pseudorandomness, interactive proof systems and zero knowledge, and probabilistically checkable proofs (PCPs). The volume is recommended for independent study and is suitable for graduate students and researchers interested in computational complexity. Information for our distributors: Members of the Mathematical Association of America (MAA) and the National Council of Teachers of Mathematics (NCTM) receive a 20 discount from list price. Nº de ref. del artículo: AAN9780821828724

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 75,76
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Reino Unido a España
Destinos, gastos y plazos de envío

4.

Publicado por American Mathematical Society
ISBN 10: 082182872X ISBN 13: 9780821828724
Nuevo Tapa dura Cantidad disponible: 1
Librería
THE SAINT BOOKSTORE
(Southport, Reino Unido)
Valoración
[?]

Descripción American Mathematical Society. Hardback. Condición: New. New copy - Usually dispatched within 2 working days. Nº de ref. del artículo: B9780821828724

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 70,08
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 7,97
De Reino Unido a España
Destinos, gastos y plazos de envío

5.

Steve Rudich
Publicado por American Mathematical Society (2004)
ISBN 10: 082182872X ISBN 13: 9780821828724
Nuevo Cantidad disponible: 1
Librería
Books2Anywhere
(Fairford, GLOS, Reino Unido)
Valoración
[?]

Descripción American Mathematical Society, 2004. HRD. Condición: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Nº de ref. del artículo: CE-9780821828724

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 74,96
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 9,18
De Reino Unido a España
Destinos, gastos y plazos de envío

6.

Steven Rudich and Avi Wigderson, Steven Rudich (Editor), Avi Wigderson (Editor)
Publicado por American Mathematical Society, IAS/Park City Mathematics Institute (2004)
ISBN 10: 082182872X ISBN 13: 9780821828724
Nuevo Tapa dura Cantidad disponible: 1
Librería
Ergodebooks
(RICHMOND, TX, Estados Unidos de America)
Valoración
[?]

Descripción American Mathematical Society, IAS/Park City Mathematics Institute, 2004. Hardcover. Condición: New. Nº de ref. del artículo: DADAX082182872X

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 81,54
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 10,50
De Estados Unidos de America a España
Destinos, gastos y plazos de envío

7.

Rudich, Steven (Editor)/ Wigderson, Avi (Editor)
Publicado por Amer Mathematical Society (2004)
ISBN 10: 082182872X ISBN 13: 9780821828724
Nuevo Tapa dura Cantidad disponible: 1
Librería
Revaluation Books
(Exeter, Reino Unido)
Valoración
[?]

Descripción Amer Mathematical Society, 2004. Hardcover. Condición: Brand New. illustrated edition. 389 pages. 10.50x7.50x1.25 inches. In Stock. Nº de ref. del artículo: __082182872X

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 94,19
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 17,21
De Reino Unido a España
Destinos, gastos y plazos de envío

8.

Steven Rudich and Avi Wigderson
Publicado por American Mathematical Society, (2004)
ISBN 10: 082182872X ISBN 13: 9780821828724
Nuevo Tapa dura Cantidad disponible: 2
Librería
Murray Media
(North Miami Beach, FL, Estados Unidos de America)
Valoración
[?]

Descripción American Mathematical Society, 2004. Hardcover. Condición: New. Never used!. Nº de ref. del artículo: P11082182872X

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 120,73
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 16,15
De Estados Unidos de America a España
Destinos, gastos y plazos de envío

9.

Steven Rudich and Avi Wigderson
Publicado por American Mathematical Society, IAS/Park City Mathematics Institute (2004)
ISBN 10: 082182872X ISBN 13: 9780821828724
Nuevo Tapa dura Cantidad disponible: 1
Librería
Irish Booksellers
(Portland, ME, Estados Unidos de America)
Valoración
[?]

Descripción American Mathematical Society, IAS/Park City Mathematics Institute, 2004. Condición: New. book. Nº de ref. del artículo: M082182872X

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 106,17
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 38,78
De Estados Unidos de America a España
Destinos, gastos y plazos de envío