|
Conferences in DBLP
Poly-logarithmic Independence Fools AC0 Circuits. [Citation Graph (, )][DBLP]
k-Subgraph Isomorphism on AC0 Circuits. [Citation Graph (, )][DBLP]
Fixed-Polynomial Size Circuit Bounds. [Citation Graph (, )][DBLP]
A New Characterization of ACC0 and Probabilistic CC0. [Citation Graph (, )][DBLP]
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent. [Citation Graph (, )][DBLP]
The Proof Complexity of Polynomial Identities. [Citation Graph (, )][DBLP]
Locally Testable Codes Require Redundant Testers. [Citation Graph (, )][DBLP]
Every Permutation CSP of arity 3 is Approximation Resistant. [Citation Graph (, )][DBLP]
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. [Citation Graph (, )][DBLP]
Are PCPs Inherent in Efficient Arguments? [Citation Graph (, )][DBLP]
Extractors for Low-Weight Affine Sources. [Citation Graph (, )][DBLP]
Extractors for Varieties. [Citation Graph (, )][DBLP]
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma. [Citation Graph (, )][DBLP]
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. [Citation Graph (, )][DBLP]
An Almost Optimal Rank Bound for Depth-3 Identities. [Citation Graph (, )][DBLP]
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete. [Citation Graph (, )][DBLP]
Improved Approximation of Linear Threshold Functions. [Citation Graph (, )][DBLP]
On the Complexity of Boolean Functions in Different Characteristics. [Citation Graph (, )][DBLP]
The Complexity of the Annihilating Polynomial. [Citation Graph (, )][DBLP]
One-Way Functions and the Berman-Hartmanis Conjecture. [Citation Graph (, )][DBLP]
Planar Graph Isomorphism is in Log-Space. [Citation Graph (, )][DBLP]
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies. [Citation Graph (, )][DBLP]
Quantum Copy-Protection and Quantum Money. [Citation Graph (, )][DBLP]
Parallel Approximation of Non-interactive Zero-sum Quantum Games. [Citation Graph (, )][DBLP]
Lower Bounds on Quantum Multiparty Communication Complexity. [Citation Graph (, )][DBLP]
Increasing the Gap between Descriptional Complexity and Algorithmic Probability. [Citation Graph (, )][DBLP]
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in. [Citation Graph (, )][DBLP]
Multitask Efficiencies in the Decision Tree Model. [Citation Graph (, )][DBLP]
Worst-Case Running Times for Average-Case Algorithms. [Citation Graph (, )][DBLP]
On Basing ZK ≠ BPP on the Hardness of PAC Learning. [Citation Graph (, )][DBLP]
Infinite vs. Finite Space-Bounded Randomized Computations. [Citation Graph (, )][DBLP]
On the Communication Complexity of Read-Once AC^0 Formulae. [Citation Graph (, )][DBLP]
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions. [Citation Graph (, )][DBLP]
An Approximation Algorithm for Approximation Rank. [Citation Graph (, )][DBLP]
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences. [Citation Graph (, )][DBLP]
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. [Citation Graph (, )][DBLP]
The Maximum Communication Complexity of Multi-Party Pointer Jumping. [Citation Graph (, )][DBLP]
|