Searching...
Advanced Search
CC
CCC
2008
2008 IEEE 23rd Annual 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
2008 IEEE 23rd Annual Conference on Computational Complexity
June 22-June 26
ISBN: 978-0-7695-3169-4
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
Title Page iv - Copyright Page
(PDF)
pp. iv
ABSTRACT
PDF
Table of Contents
(PDF)
pp. v-viii
ABSTRACT
PDF
Preface
(PDF)
pp. ix
ABSTRACT
PDF
Committees
(PDF)
pp. x
ABSTRACT
PDF
Reviewers
(PDF)
pp. xi
ABSTRACT
PDF
Awards
(PDF)
pp. xii
ABSTRACT
PDF
NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly
(Abstract)
Harry Buhrman
John M. Hitchcock
pp. 1-7
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
(Abstract)
Kord Eickmeyer
Martin Grohe
Magdalena Gr?
pp. 8-18
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Hardness Amplification within NP against Deterministic Algorithms
(Abstract)
Parikshit Gopalan
Venkatesan Guruswami
pp. 19-30
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Amplifying Lower Bounds by Means of Self-Reducibility
(Abstract)
Eric Allender
Michal Kouck?
pp. 31-40
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Amplifying ZPP^SAT[1] and the Two Queries Problem
(Abstract)
Richard Chang
Suresh Purini
pp. 41-52
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Learning Complexity vs. Communication Complexity
(Abstract)
Nati Linial
Adi Shraibman
pp. 53-63
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Communication Complexity under Product and Nonproduct Distributions
(Abstract)
Alexander A. Sherstov
pp. 64-70
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A Direct Product Theorem for Discrepancy
(Abstract)
Troy Lee
Adi Shraibman
Robert ?palek
pp. 71-80
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model
(Abstract)
Troy Lee
Adi Shraibman
pp. 81-91
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size
(Abstract)
Kristoffer Arnsfelt Hansen
pp. 92-99
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs
(Abstract)
Nathan Segerlind
pp. 100-111
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions
(Abstract)
Alexander A. Sherstov
pp. 112-123
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The Sum of d Small-Bias Generators Fools Polynomials of Degree d
(Abstract)
Emanuele Viola
pp. 124-127
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Lower Bounds and Separations for Constant Depth Multilinear Circuits
(Abstract)
Ran Raz
Amir Yehudayoff
pp. 128-139
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Noisy Interpolating Sets for Low Degree Polynomials
(Abstract)
Zeev Dvir
Amir Shpilka
pp. 140-148
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Constraint Logic: A Uniform Framework for Modeling Computation as Games
(Abstract)
Erik D. Demaine
Robert A. Hearn
pp. 149-162
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes
(Abstract)
Venkatesan Guruswami
Atri Rudra
pp. 163-174
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers
(Abstract)
Kiran S. Kedlaya
Sergey Yekhanin
pp. 175-186
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
(Abstract)
Tsuyoshi Ito
Hirotada Kobayashi
Daniel Preda
Xiaoming Sun
Andrew C.-C. Yao
pp. 187-198
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The Quantum Moment Problem and Bounds on Entangled Multi-prover Games
(Abstract)
Andrew C. Doherty
Yeong-Cherng Liang
Ben Toner
Stephanie Wehner
pp. 199-210
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Using Entanglement in Quantum Multi-prover Interactive Proofs
(Abstract)
Julia Kempe
Hirotada Kobayashi
Keiji Matsumoto
Thomas Vidick
pp. 211-222
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The Power of Unentanglement
(Abstract)
Scott Aaronson
Salman Beigi
Andrew Drucker
Bill Fefferman
Peter Shor
pp. 223-236
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The Multiplicative Quantum Adversary
(Abstract)
Robert ?palek
pp. 237-248
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Approximation Resistant Predicates from Pairwise Independence
(Abstract)
Per Austrin
Elchanan Mossel
pp. 249-258
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
2-Transitivity Is Insufficient for Local Testability
(Abstract)
Elena Grigorescu
Tali Kaufman
Madhu Sudan
pp. 259-267
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
New Results on Noncommutative and Commutative Polynomial Identity Testing
(Abstract)
V. Arvind
Partha Mukhopadhyay
Srikanth Srinivasan
pp. 268-279
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In
(Abstract)
Zohar S. Karnin
Amir Shpilka
pp. 280-291
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Quantum Expanders: Motivation and Constructions
(Abstract)
Avraham Ben-Aroya
Oded Schwartz
Amnon Ta-Shma
pp. 292-303
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Towards Dimension Expanders over Finite Fields
(Abstract)
Zeev Dvir
Amir Shpilka
pp. 304-310
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Detecting Rational Points on Hypersurfaces over Finite Fields
(Abstract)
Swastik Kopparty
Sergey Yekhanin
pp. 311-320
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Randomised Individual Communication Complexity
(Abstract)
Harry Buhrman
Michal Kouck?
Nikolai Vereshchagin
pp. 321-331
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
(Abstract)
Dmitry Gavinsky
Pavel Pudl?
pp. 332-339
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Author Index
(PDF)
pp. 341
ABSTRACT
PDF
Roster
(PDF)
pp. 342
ABSTRACT
PDF
Peer Review Notice
|
Give Us Feedback
Usage of this product signifies your acceptance of the
Terms of Use
.
Open
Download