Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 36 results in range #1 to #36.

Another Motivation for Reducing the Randomness Complexity of Algorithms: Label: en
Contemplations on Testing Graph Properties: Label: en
On Security Preserving Reductions – Revised Terminology: Label: en
Randomness and Computation: Label: en
Introduction to Testing Graph Properties: Label: en
A Brief Introduction to Property Testing: Label: en
Basic Facts about Expander Graphs: Label: en
Average Case Complexity, Revisited: Label: en
Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art: Label: en
On the Complexity of Computational Problems Regarding Distributions: Label: en
Bravely, Moderately: A Common Theme in Four Recent Works: Label: en
Short Locally Testable Codes and Proofs: Label: en
A Sample of Samplers: A Computational Perspective on Sampling: Label: en
On Yao’s XOR-Lemma: Label: en
Three XOR-Lemmas — An Exposition: Label: en
Notes on Levin’s Theory of Average-Case Complexity: Label: en
In a World of P=BPP: Label: en
Proximity Oblivious Testing and the Role of Invariances: Label: en
Testing Graph Blow-Up: Label: en
From Absolute Distinguishability to Positive Distinguishability: Label: en
A Candidate Counterexample to the Easy Cylinders Conjecture: Label: en
On the Average-Case Complexity of Property Testing: Label: en
On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge: Label: en
From Logarithmic Advice to Single-Bit Advice: Label: en
The GGM Construction Does NOT Yield Correlation Intractable Function Ensembles: Label: en
Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs: Label: en
Candidate One-Way Functions Based on Expander Graphs: Label: en
On Testing Expansion in Bounded-Degree Graphs: Label: en
Simplified Derandomization of BPP Using a Hitting Set Generator: Label: en
Strong Proofs of Knowledge: Label: en
Another Proof That $\mathcal{BPP}\subseteq \mathcal{PH}$ (and More): Label: en
Collision-Free Hashing from Lattice Problems: Label: en
On the Circuit Complexity of Perfect Hashing: Label: en
On Constructing 1-1 One-Way Functions: Label: en
Proving Computational Ability: Label: en
Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard: Label: en