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 46 results in range #1 to #46.

On the power of conditional samples in distribution testing: Label: en
Sparse extractor families for all the entropy: Label: en
H-wise independence: Label: en
New affine-invariant codes from lifting: Label: en
Sorting noisy data with partial information: Label: en
Robust optimization in the presence of uncertainty: Label: en
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints: Label: en
Catch them if you can: Label: en
Competing provers protocols for circuit evaluation: Label: en
Pseudo-partitions, transversality and locality: Label: en
Properties and applications of boolean function composition: Label: en
Time hierarchies for sampling distributions: Label: en
Resource-based corruptions and the combinatorics of hidden diversity: Label: en
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: Label: en
On the power of nonuniformity in proofs of security: Label: en
Publicly verifiable proofs of sequential work: Label: en
An equational approach to secure multi-party computation: Label: en
Active self-assembly of algorithmic shapes and patterns in polylogarithmic time: Label: en
Stronger methods of making quantum interactive proofs perfectly complete: Label: en
Adversary lower bound for the k-sum problem: Label: en
Streaming computations with a loquacious prover: Label: en
An energy complexity model for algorithms: Label: en
Runtime guarantees for regression problems: Label: en
Reachability in graph timelines: Label: en
Welfare maximization and the supermodular degree: Label: en
Learning and incentives in user-generated content: Label: en
Approaching utopia: Label: en
On the power of many one-bit provers: Label: en
On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction: Label: en
A characterization of approximation resistance for even k-partite CSPs: Label: en
Towards an optimal query efficient PCP?: Label: en
Space-bounded communication complexity: Label: en
The garden-hose model: Label: en
Evasiveness through a circuit lens: Label: en
On the possibilities and limitations of pseudodeterministic algorithms: Label: en
Barriers in cryptography with weak, correlated and leaky sources: Label: en
Characterizing the sample complexity of private learners: Label: en
Differentially private data analysis of social networks via restricted sensitivity: Label: en
Is privacy compatible with truthfulness?: Label: en
On the convergence of the Hegselmann-Krause system: Label: en
Making evolution rigorous: Label: en
Can theories be tested?: Label: en
Learnability of DNF with representation-specific queries: Label: en
Low-weight halfspaces for sparse boolean vectors: Label: en
Learning mixtures of spherical gaussians: Label: en
Massive online teaching to bounded learners: Label: en