The SCEAS System
Navigation Menu

Conferences in DBLP

Conference on Computational Complexity / (coco)
2009 (conf/coco/2009)


  1. Poly-logarithmic Independence Fools AC0 Circuits. [Citation Graph (, )][DBLP]


  2. k-Subgraph Isomorphism on AC0 Circuits. [Citation Graph (, )][DBLP]


  3. Fixed-Polynomial Size Circuit Bounds. [Citation Graph (, )][DBLP]


  4. A New Characterization of ACC0 and Probabilistic CC0. [Citation Graph (, )][DBLP]


  5. A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent. [Citation Graph (, )][DBLP]


  6. The Proof Complexity of Polynomial Identities. [Citation Graph (, )][DBLP]


  7. Locally Testable Codes Require Redundant Testers. [Citation Graph (, )][DBLP]


  8. Every Permutation CSP of arity 3 is Approximation Resistant. [Citation Graph (, )][DBLP]


  9. Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. [Citation Graph (, )][DBLP]


  10. Are PCPs Inherent in Efficient Arguments? [Citation Graph (, )][DBLP]


  11. Extractors for Low-Weight Affine Sources. [Citation Graph (, )][DBLP]


  12. Extractors for Varieties. [Citation Graph (, )][DBLP]


  13. Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma. [Citation Graph (, )][DBLP]


  14. Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. [Citation Graph (, )][DBLP]


  15. An Almost Optimal Rank Bound for Depth-3 Identities. [Citation Graph (, )][DBLP]


  16. Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete. [Citation Graph (, )][DBLP]


  17. Improved Approximation of Linear Threshold Functions. [Citation Graph (, )][DBLP]


  18. On the Complexity of Boolean Functions in Different Characteristics. [Citation Graph (, )][DBLP]


  19. The Complexity of the Annihilating Polynomial. [Citation Graph (, )][DBLP]


  20. One-Way Functions and the Berman-Hartmanis Conjecture. [Citation Graph (, )][DBLP]


  21. Planar Graph Isomorphism is in Log-Space. [Citation Graph (, )][DBLP]


  22. Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies. [Citation Graph (, )][DBLP]


  23. Quantum Copy-Protection and Quantum Money. [Citation Graph (, )][DBLP]


  24. Parallel Approximation of Non-interactive Zero-sum Quantum Games. [Citation Graph (, )][DBLP]


  25. Lower Bounds on Quantum Multiparty Communication Complexity. [Citation Graph (, )][DBLP]


  26. Increasing the Gap between Descriptional Complexity and Algorithmic Probability. [Citation Graph (, )][DBLP]


  27. Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in. [Citation Graph (, )][DBLP]


  28. Multitask Efficiencies in the Decision Tree Model. [Citation Graph (, )][DBLP]


  29. Worst-Case Running Times for Average-Case Algorithms. [Citation Graph (, )][DBLP]


  30. On Basing ZK ≠ BPP on the Hardness of PAC Learning. [Citation Graph (, )][DBLP]


  31. Infinite vs. Finite Space-Bounded Randomized Computations. [Citation Graph (, )][DBLP]


  32. On the Communication Complexity of Read-Once AC^0 Formulae. [Citation Graph (, )][DBLP]


  33. Lower Bounds on the Randomized Communication Complexity of Read-Once Functions. [Citation Graph (, )][DBLP]


  34. An Approximation Algorithm for Approximation Rank. [Citation Graph (, )][DBLP]


  35. A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences. [Citation Graph (, )][DBLP]


  36. New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. [Citation Graph (, )][DBLP]


  37. The Maximum Communication Complexity of Multi-Party Pointer Jumping. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002