Picture 1 of 1
Picture 1 of 1
Studies in Complexity and Cryptography : Miscellanea on the Interplay Between...
US $113.61
ApproximatelyAU $165.84
Condition:
Brand new
A new, unread, unused book in perfect condition with no missing or damaged pages. See the seller's listing for full details.
3 available
Postage:
Free Economy Shipping.
Located in: Jessup, Maryland, United States
Delivery:
Estimated between Tue, 8 Oct and Tue, 15 Oct to 43230
Returns:
14-day returns. Buyer pays for return postage.
Payments:
Shop with confidence
Seller assumes all responsibility for this listing.
eBay item number:355670870523
Item specifics
- Condition
- 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
About this product
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
Item description from the seller
Seller Feedback (353,607)
- 8***5 (18)- Feedback left by buyer.Past monthVerified purchaseI didn't see a verbal description of this book as "hardcover" or paperback. Cover design and price were similar to both cover styles. I thought I'd left a question for the seller, but I may have done something wrong. The package was too small to match the hardcovers previously received so I returned it unopened. Seller was very efficient, and packaging offered excellent protection. Haven't checked to see if refund was processed.
- w***t (661)- Feedback left by buyer.Past 6 monthsVerified purchasePERFECT TRANSACTION! Shipped right after payment, well packaged, arrived during the estimated time. The item is in great condition EXACTLY as described. Very Happy, very nice purchase. Excellent communication. Thank youWindfall Battleships : Agincourt, Canada, Erin, Eagle and the Balkan and Lati... (#386149502698)
- l***l (29)- Feedback left by buyer.Past yearVerified purchaseExcellent! This seller has really good prices, communication, packaging and fast shipping. The book I bought was better than described and I would definitely buy from this seller again. It was my time to have this book.🙌 A+++++El Kybalion by Trismegisto, Hermes, Like New Used, Free shipping in the US (#354955234211)
Product ratings and reviews
More to explore:
- Study Guide School Textbooks & Study Guides,
- Language Study School Textbooks & Study Guides in Italian,
- Language Study School Textbooks & Study Guides in Spanish,
- School Textbooks & Study Guides,
- Language Study School Textbooks & Study Guides in Japanese,
- Language Study Textbooks,
- Science School Textbooks & Study Guides,
- Biology School Textbooks & Study Guides,
- Physics School Textbooks & Study Guides,
- Law School Textbooks & Study Guides