Computational Complexity: A Conceptual Perspective
Goldreich, Oded
ISBN 10: 052188473X ISBN 13: 9780521884730
Editorial: Cambridge University Press, 2008
Usado
hardcover
Librería:
Textbooks_Source, Columbia, MO, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 10 de noviembre de 2017
Este artículo en concreto ya no está disponible.
Descripción
Descripción:
Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). N° de ref. del artículo 000937790U
Sinopsis:
A conceptual introduction to the study of the intrinsic complexity of computational tasks. It will serve advanced undergraduate and graduate students, either as a textbook or for self-study. It provides explanations of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness, and probabilistic proof systems.
Acerca del autor: Oded Goldreich is a Professor of Computer Science at the Weizmann Institute of Science and an Incumbent of the Meyer W. Weisgal Professorial Chair. He is an editor for the SIAM Journal on Computing, the Journal of Cryptology, and Computational Complexity and previously authored the books Modern Cryptography, Probabalistic Proofs and Pseudorandomness and the two-volume work Foundations of Cryptography.
"Sobre este título" puede pertenecer a otra edición de este libro.
Detalles bibliográficos
Título: Computational Complexity: A Conceptual ...
Editorial: Cambridge University Press
Año de publicación: 2008
Encuadernación: hardcover
Condición: Good
Edición: 1st Edition.
Los mejores resultados en AbeBooks
Imagen de archivo
Computational Complexity (Hardcover)
Publicado por
Cambridge University Press, Cambridge, 2008
ISBN 10: 052188473X
ISBN 13: 9780521884730
Nuevo
Tapa dura
Original o primera edición
Librería: CitiRetail, Stevenage, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theory. It is intended to serve as an introduction for advanced undergraduate and graduate students, either as a textbook or for self-study. The book will also be useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems. In each case, the author starts by posing the intuitive questions that are addressed by the sub-area and then discusses the choices made in the actual formulation of these questions, the approaches that lead to the answers, and the ideas that are embedded in these answers. A conceptual introduction to the study of the intrinsic complexity of computational tasks. It will serve advanced undergraduate and graduate students, either as a textbook or for self-study. It provides explanations of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness, and probabilistic proof systems. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Nº de ref. del artículo: 9780521884730
Cantidad disponible: 1 disponibles
Imagen de archivo
Computational Complexity (Hardcover)
Publicado por
Cambridge University Press, Cambridge, 2008
ISBN 10: 052188473X
ISBN 13: 9780521884730
Nuevo
Tapa dura
Original o primera edición
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theory. It is intended to serve as an introduction for advanced undergraduate and graduate students, either as a textbook or for self-study. The book will also be useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems. In each case, the author starts by posing the intuitive questions that are addressed by the sub-area and then discusses the choices made in the actual formulation of these questions, the approaches that lead to the answers, and the ideas that are embedded in these answers. A conceptual introduction to the study of the intrinsic complexity of computational tasks. It will serve advanced undergraduate and graduate students, either as a textbook or for self-study. It provides explanations of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness, and probabilistic proof systems. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9780521884730
Cantidad disponible: 1 disponibles
Imagen de archivo
Computational Complexity (Hardcover)
Publicado por
Cambridge University Press, Cambridge, 2008
ISBN 10: 052188473X
ISBN 13: 9780521884730
Nuevo
Tapa dura
Original o primera edición
Librería: AussieBookSeller, Truganina, VIC, Australia
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theory. It is intended to serve as an introduction for advanced undergraduate and graduate students, either as a textbook or for self-study. The book will also be useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems. In each case, the author starts by posing the intuitive questions that are addressed by the sub-area and then discusses the choices made in the actual formulation of these questions, the approaches that lead to the answers, and the ideas that are embedded in these answers. A conceptual introduction to the study of the intrinsic complexity of computational tasks. It will serve advanced undergraduate and graduate students, either as a textbook or for self-study. It provides explanations of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness, and probabilistic proof systems. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Nº de ref. del artículo: 9780521884730
Cantidad disponible: 1 disponibles
Imagen del vendedor
Computational Complexity
Publicado por
Cambridge University Press, GB, 2008
ISBN 10: 052188473X
ISBN 13: 9780521884730
Nuevo
Tapa dura
Original o primera edición
Librería: Rarewaves.com UK, London, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardback. Condición: New. 1st. Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theory. It is intended to serve as an introduction for advanced undergraduate and graduate students, either as a textbook or for self-study. The book will also be useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems. In each case, the author starts by posing the intuitive questions that are addressed by the sub-area and then discusses the choices made in the actual formulation of these questions, the approaches that lead to the answers, and the ideas that are embedded in these answers. Nº de ref. del artículo: LU-9780521884730
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Computational Complexity
Publicado por
Cambridge University Press, GB, 2008
ISBN 10: 052188473X
ISBN 13: 9780521884730
Nuevo
Tapa dura
Original o primera edición
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardback. Condición: New. 1st. Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theory. It is intended to serve as an introduction for advanced undergraduate and graduate students, either as a textbook or for self-study. The book will also be useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems. In each case, the author starts by posing the intuitive questions that are addressed by the sub-area and then discusses the choices made in the actual formulation of these questions, the approaches that lead to the answers, and the ideas that are embedded in these answers. Nº de ref. del artículo: LU-9780521884730
Cantidad disponible: Más de 20 disponibles