Pages that link to "Item:Q3088168"
From MaRDI portal
The following pages link to Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation (Q3088168):
Displaying 36 items.
- Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard (Q3088169) (← links)
- Proving Computational Ability (Q3088170) (← links)
- On Constructing 1-1 One-Way Functions (Q3088171) (← links)
- On the Circuit Complexity of Perfect Hashing (Q3088172) (← links)
- Collision-Free Hashing from Lattice Problems (Q3088173) (← links)
- Another Proof That $\mathcal{BPP}\subseteq \mathcal{PH}$ (and More) (Q3088174) (← links)
- Strong Proofs of Knowledge (Q3088175) (← links)
- Simplified Derandomization of BPP Using a Hitting Set Generator (Q3088176) (← links)
- On Testing Expansion in Bounded-Degree Graphs (Q3088177) (← links)
- Candidate One-Way Functions Based on Expander Graphs (Q3088178) (← links)
- Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs (Q3088179) (← links)
- The GGM Construction Does NOT Yield Correlation Intractable Function Ensembles (Q3088180) (← links)
- From Logarithmic Advice to Single-Bit Advice (Q3088181) (← links)
- On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge (Q3088182) (← links)
- On the Average-Case Complexity of Property Testing (Q3088183) (← links)
- A Candidate Counterexample to the Easy Cylinders Conjecture (Q3088184) (← links)
- From Absolute Distinguishability to Positive Distinguishability (Q3088185) (← links)
- In a World of P=BPP (Q3088186) (← links)
- Notes on Levin’s Theory of Average-Case Complexity (Q3088187) (← links)
- Three XOR-Lemmas — An Exposition (Q3088188) (← links)
- On Yao’s XOR-Lemma (Q3088189) (← links)
- A Sample of Samplers: A Computational Perspective on Sampling (Q3088190) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- Bravely, Moderately: A Common Theme in Four Recent Works (Q3088192) (← links)
- On the Complexity of Computational Problems Regarding Distributions (Q3088193) (← links)
- Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art (Q3088194) (← links)
- Average Case Complexity, Revisited (Q3088195) (← links)
- Basic Facts about Expander Graphs (Q3088196) (← links)
- A Brief Introduction to Property Testing (Q3088197) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Randomness and Computation (Q3088199) (← links)
- On Security Preserving Reductions – Revised Terminology (Q3088200) (← links)
- Contemplations on Testing Graph Properties (Q3088201) (← links)
- Another Motivation for Reducing the Randomness Complexity of Algorithms (Q3088202) (← links)
- Testing Graph Blow-Up (Q5894229) (← links)
- Proximity Oblivious Testing and the Role of Invariances (Q5894230) (← links)