Photo 1/1
Photo 1/1
Études de complexité et cryptographie : Miscellanea sur l'interaction entre Ran
113,62 USD
Environ101,97 EUR
État :
Neuf
Livre neuf, n'ayant jamais été lu ni utilisé, en parfait état, sans pages manquantes ni endommagées. Consulter l'annonce du vendeur pour avoir plus de détails.
3 disponibles
Livraison :
Gratuit Economy Shipping.
Lieu où se trouve l'objet : Fairfield, Ohio, États-Unis
Délai de livraison :
Estimé entre le ven. 4 oct. et le jeu. 10 oct. à 43230
Retours :
Retour sous 30 jours. L'acheteur paie les frais de retour.
Paiements :
Achetez en toute confiance
Le vendeur assume l'entière responsabilité de cette annonce.
Numéro de l'objet eBay :386659264556
Dernière mise à jour le 01 sept. 2024 11:28:47 CEST. Afficher toutes les modificationsAfficher toutes les modifications
Caractéristiques de l'objet
- État
- ISBN-13
- 9783642226694
- Book Title
- Studies in Complexity and Cryptography
- 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
À propos de ce produit
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
Description de l'objet fournie par le vendeur
Informations sur le vendeur professionnel
Premier Books LLC
David Taylor
26C Trolley Sq
19806-3356 Wilmington, DE
United States
Je certifie que toutes mes activités de vente seront conformes à toutes les lois et réglementations de l'UE.
Catégories populaires de cette Boutique
Inscrit comme vendeur professionnel
Évaluations en tant que vendeur (1.032.489)
- c***c (266)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéI love his books 📚. And it's true crime solved.
- e***a (3869)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéGreat Book on lunch pails
- d***_ (1049)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéperfect