Searching...
Advanced Search
CC
CCC
2009
2009 24th Annual IEEE Conference on Computational Complexity
This Publication
Digital Library
Advanced Search
This Publication
Subscribe to this Publication
Login to access your subscribed content
Bibliographic References
ASCII Text
BibTex
Refworks Procite/RefMan
2009 24th Annual IEEE Conference on Computational Complexity
Paris, France
July 15-July 18
ISBN: 978-0-7695-3717-7
Table of Contents
Papers
Cover Art
(PDF)
pp. C4,C1
ABSTRACT
PDF
Title Page i
(PDF)
pp. i
ABSTRACT
PDF
Title Page iii
(PDF)
pp. iii
ABSTRACT
PDF
Copyright Page
(PDF)
pp. iv
ABSTRACT
PDF
Table of Contents
(PDF)
pp. v-vii
ABSTRACT
PDF
Conference Information
(PDF)
pp. viii-xi
ABSTRACT
PDF
Poly-logarithmic Independence Fools AC^0 Circuits
(Abstract)
Mark Braverman
pp. 3-8
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
k-Subgraph Isomorphism on AC_0 Circuits
(Abstract)
Kazuyuki Amano
pp. 9-18
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Fixed-Polynomial Size Circuit Bounds
(Abstract)
Lance Fortnow
Rahul Santhanam
Ryan Williams
pp. 19-26
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A New Characterization of ACC^0 and Probabilistic CC^0
(Abstract)
Kristoffer Arnsfelt Hansen
Michal Koucký
pp. 27-34
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
(Abstract)
Pascal Koiran
Sylvain Perifel
pp. 35-40
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The Proof Complexity of Polynomial Identities
(Abstract)
Pavel Hrubeš
Iddo Tzameret
pp. 41-51
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Locally Testable Codes Require Redundant Testers
(Abstract)
Eli Ben-Sasson
Venkatesan Guruswami
Tali Kaufman
Madhu Sudan
Michael Viderman
pp. 52-61
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Every Permutation CSP of arity 3 is Approximation Resistant
(Abstract)
Moses Charikar
Venkatesan Guruswami
Rajsekar Manokaran
pp. 62-73
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
(Abstract)
Per Austrin
Subhash Khot
Muli Safra
pp. 74-80
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Are PCPs Inherent in Efficient Arguments?
(Abstract)
Guy N. Rothblum
Salil Vadhan
pp. 81-92
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Extractors for Low-Weight Affine Sources
(Abstract)
Anup Rao
pp. 95-101
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Extractors for Varieties
(Abstract)
Zeev Dvir
pp. 102-113
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
(Abstract)
Ronen Shaltiel
pp. 114-125
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution
(Abstract)
Luca Trevisan
Madhur Tulsiani
Salil Vadhan
pp. 126-136
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An Almost Optimal Rank Bound for Depth-3 Identities
(Abstract)
Nitin Saxena
C. Seshadhri
pp. 137-148
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete
(Abstract)
Akitoshi Kawamura
pp. 149-160
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Improved Approximation of Linear Threshold Functions
(Abstract)
Ilias Diakonikolas
Rocco A. Servedio
pp. 161-172
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the Complexity of Boolean Functions in Different Characteristics
(Abstract)
Parikshit Gopalan
Shachar Lovett
Amir Shpilka
pp. 173-183
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The Complexity of the Annihilating Polynomial
(Abstract)
Neeraj Kayal
pp. 184-193
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
One-Way Functions and the Berman-Hartmanis Conjecture
(Abstract)
Manindra Agrawal
Osamu Watanabe
pp. 194-202
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Planar Graph Isomorphism is in Log-Space
(Abstract)
Samir Datta
Nutan Limaye
Prajakta Nimbhorkar
Thomas Thierauf
Fabian Wagner
pp. 203-214
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
(Abstract)
Tsuyoshi Ito
Hirotada Kobayashi
Keiji Matsumoto
pp. 217-228
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Quantum Copy-Protection and Quantum Money
(Abstract)
Scott Aaronson
pp. 229-242
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Parallel Approximation of Non-interactive Zero-sum Quantum Games
(Abstract)
Rahul Jain
John Watrous
pp. 243-253
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Lower Bounds on Quantum Multiparty Communication Complexity
(Abstract)
Troy Lee
Gideon Schechtman
Adi Shraibman
pp. 254-262
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
(Abstract)
Adam R. Day
pp. 263-273
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
(Abstract)
Zohar S. Karnin
Amir Shpilka
pp. 274-285
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Multitask Efficiencies in the Decision Tree Model
(Abstract)
Andrew Drucker
pp. 286-297
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Worst-Case Running Times for Average-Case Algorithms
(Abstract)
Luís Antunes
Lance Fortnow
pp. 298-303
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On Basing ZK ≠ BPP on the Hardness of PAC Learning
(Abstract)
David Xiao
pp. 304-315
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Infinite vs. Finite Space-Bounded Randomized Computations
(Abstract)
Richard Královic
pp. 316-325
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the Communication Complexity of Read-Once AC^0 Formulae
(Abstract)
T.S. Jayram
Swastik Kopparty
Prasad Raghavendra
pp. 329-340
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
(Abstract)
Nikos Leonardos
Michael Saks
pp. 341-350
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An Approximation Algorithm for Approximation Rank
(Abstract)
Troy Lee
Adi Shraibman
pp. 351-357
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
(Abstract)
Joshua Brody
Amit Chakrabarti
pp. 358-368
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
(Abstract)
Rahul Jain
Hartmut Klauck
pp. 369-378
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The Maximum Communication Complexity of Multi-Party Pointer Jumping
(Abstract)
Joshua Brody
pp. 379-386
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Author Index
(PDF)
pp. 387
ABSTRACT
PDF
Roster Page
(PDF)
pp. 388
ABSTRACT
PDF
Peer Review Notice
|
Give Us Feedback
Usage of this product signifies your acceptance of the
Terms of Use
.
Open
Download
