Imagen 1 de 1
Imagen 1 de 1
Estudios sobre Complejidad y Criptografía: Miscelánea sobre la Interacción Entre...-
USD113,61
Aproximadamente102,06 EUR
Estado:
Nuevo
Libro nuevo, sin usar y sin leer, que está en perfecto estado; incluye todas las páginas sin defectos. Consulta el anuncio del vendedor para obtener más información.
3 disponibles
Envío:
Gratis Economy Shipping.
Ubicado en: Jessup, Maryland, Estados Unidos
Entrega:
Entrega prevista entre el mar. 8 oct. y el mar. 15 oct. a 43230
Devoluciones:
14 días para devoluciones. El comprador paga el envío de la devolución.
Pagos:
Compra con confianza
El vendedor asume toda la responsabilidad de este anuncio.
N.º de artículo de eBay:355670870523
Última actualización el 16 sep 2024 10:48:56 H.EspVer todas las actualizacionesVer todas las actualizaciones
Características del artículo
- Estado
- Book Title
- Studies in Complexity and Cryptography : Miscellanea on the Inter
- ISBN
- 9783642226694
- Subject Area
- Mathematics, Computers, Language Arts & Disciplines
- Publication Name
- Studies in Complexity and Cryptography : Miscellanea on the Interplay Between Randomness and Computation
- Publisher
- Springer Berlin / Heidelberg
- Item Length
- 9.3 in
- Subject
- Machine Theory, Communication Studies, Security / Cryptography, Computer Science, Discrete Mathematics
- Publication Year
- 2011
- Series
- Lecture Notes in Computer Science Ser.
- Type
- Textbook
- Format
- Trade Paperback
- Language
- English
- Item Weight
- 30.8 Oz
- Item Width
- 6.1 in
- Number of Pages
- Xii, 564 Pages
Acerca de este producto
Product Identifiers
Publisher
Springer Berlin / Heidelberg
ISBN-10
3642226698
ISBN-13
9783642226694
eBay Product ID (ePID)
109072507
Product Key Features
Number of Pages
Xii, 564 Pages
Language
English
Publication Name
Studies in Complexity and Cryptography : Miscellanea on the Interplay Between Randomness and Computation
Publication Year
2011
Subject
Machine Theory, Communication Studies, Security / Cryptography, Computer Science, Discrete Mathematics
Type
Textbook
Subject Area
Mathematics, Computers, Language Arts & Disciplines
Series
Lecture Notes in Computer Science Ser.
Format
Trade Paperback
Dimensions
Item Weight
30.8 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
2011-932979
Dewey Edition
23
Series Volume Number
6650
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
511.3/52
Table Of Content
Research Contributions.- Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard.- Proving Computational Ability.- On Constructing 1-1 One-Way Functions.- On the Circuit Complexity of Perfect Hashing.- Collision-Free Hashing from Lattice Problems.- Another Proof That BPP ⊆ PH (and More).- Strong Proofs of Knowledge.- Simplified Derandomization of BPP Using a Hitting Set Generator.- On Testing Expansion in Bounded-Degree Graphs.- Candidate One-Way Functions Based on Expander Graphs.- Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs.- The GGM Construction Does NOT Yield Correlation Intractable Function Ensembles.- From Logarithmic Advice to Single-Bit Advice.- On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge.- On the Average-Case Complexity of Property Testing.- A Candidate Counterexample to the Easy Cylinders Conjecture.- From Absolute Distinguishability to Positive Distinguishability.- Testing Graph Blow-Up.- Proximity Oblivious Testing and the Role of Invariances.- In a World of P=BPP.- Surveys.- Notes on Levin's Theory of Average-Case Complexity.- Three XOR-Lemmas -- An Exposition.- On Yao's XOR-Lemma.- A Sample of Samplers: A Computational Perspective on Sampling.- Short Locally Testable Codes and Proofs.- Bravely, Moderately: A Common Theme in Four Recent Works.- On the Complexity of Computational Problems Regarding Distributions.- Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art.- Average Case Complexity, Revisited.- Basic Facts about Expander Graphs.- A Brief Introduction to Property Testing.- Introduction to Testing Graph Properties.- Randomness and Computation.- Programmatic and Reflective Articles.- On Security Preserving Reductions - Revised Terminology.- Contemplations on Testing Graph Properties.- Another Motivationfor Reducing the Randomness Complexity of Algorithms.- About the Authors.
Synopsis
This book presents a collection of 36 pieces of scientific work in the areas of complexity theory and foundations of cryptography: 20 research contributions, 13 survey articles, and 3 programmatic and reflective viewpoint statements. These so far formally unpublished pieces were written by Oded Goldreich, some in collaboration with other scientists. The articles included in this book essentially reflect the topical scope of the scientific career of Oded Goldreich now spanning three decades. In particular the topics dealt with include average-case complexity, complexity of approximation, derandomization, expander graphs, hashing functions, locally testable codes, machines that take advice, NP-completeness, one-way functions, probabilistically checkable proofs, proofs of knowledge, property testing, pseudorandomness, randomness extractors, sampling, trapdoor permutations, zero-knowledge, and non-iterative zero-knowledge. All in all, this potpourri of studies in complexity and cryptography constitutes a most valuable contribution to the field of theoretical computer science centered around the personal achievements and views of one of its outstanding representatives., Paying witness to the author's thirty-year career in science, these high-quality papers, some co-written with colleagues, reflect his professional range, covering material from average-case complexity to derandomization and probabilistically checkable proofs., Research Contributions.- Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard.- Proving Computational Ability.- On Constructing 1-1 One-Way Functions.- On the Circuit Complexity of Perfect Hashing.- Collision-Free Hashing from Lattice Problems.- Another Proof That BPP PH (and More).- Strong Proofs of Knowledge.- Simplified Derandomization of BPP Using a Hitting Set Generator.- On Testing Expansion in Bounded-Degree Graphs.- Candidate One-Way Functions Based on Expander Graphs.- Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs.- The GGM Construction Does NOT Yield Correlation Intractable Function Ensembles.- From Logarithmic Advice to Single-Bit Advice.- On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge.- On the Average-Case Complexity of Property Testing.- A Candidate Counterexample to the Easy Cylinders Conjecture.- From Absolute Distinguishability to Positive Distinguishability.- Testing Graph Blow-Up.- Proximity Oblivious Testing and the Role of Invariances.- In a World of P=BPP.- Surveys.- Notes on Levin's Theory of Average-Case Complexity.- Three XOR-Lemmas - An Exposition.- On Yao's XOR-Lemma.- A Sample of Samplers: A Computational Perspective on Sampling.- Short Locally Testable Codes and Proofs.- Bravely, Moderately: A Common Theme in Four Recent Works.- On the Complexity of Computational Problems Regarding Distributions.- Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art.- Average Case Complexity, Revisited.- Basic Facts about Expander Graphs.- A Brief Introduction to Property Testing.- Introduction to Testing Graph Properties.- Randomness and Computation.- Programmatic and Reflective Articles.- On Security Preserving Reductions - Revised Terminology.- Contemplations on Testing Graph Properties.- Another Motivation for Reducing the Randomness Complexity of Algorithms.- About the Authors.
LC Classification Number
QA75.5-76.95
Descripción del artículo del vendedor
Información de vendedor profesional
Expert Trading Limited
John Boyer
9220 Rumsey Rd
Ste 101
21045-1956 Columbia, MD
United States
Certifico que todas mis actividades de venta cumplirán todas las leyes y reglamentos de la UE.
Registrado como vendedor profesional
Votos de vendedor (353.623)
- i***y (712)- Votos emitidos por el comprador.Últimos 6 mesesCompra verificada2 volumes of Pogo comic strips, new and in perfect condition. Price was good, but shipping cost ($30 for two books) seems like a lot for how long it took to get delivered (23 days from Illinois to Spain). Also, seller communication was not great. First two times I wrote, their response did not address question. Third response explained at length about the private courier service they use and how it should take 1-10 business days to deliver. Maybe they should consider a different courier service.
- o***l (312)- Votos emitidos por el comprador.Último añoCompra verificadaThe item was described to a Tee. Very good communication. Shipping was just a little slow. The box the set of books comes in was damaged (bent corners) due to packaging. Not a deal breaker because the grand kids will not store in that box; might be if it were to be given as a present. The three books in the box arrived in prefect shape. I WOULD purchase from greatbookprices1 again in the future. ThanksConstruction Site Board Books Set, Hardcover by Rinker, Sherri Duskey; Lichte... (#364394914625)
- r***_ (108)- Votos emitidos por el comprador.Mes pasadoCompra verificada*Same as the other review* Purchased two box sets from this seller with one being advertised as "like new" but was delivered as if it was actually new. Shipping time was a little slow, takes about 10 days to ship out and it takes a while to get through the system. But the packing was great and I'm still overall happy with my purchase.