1. Home
  2. Proceedings
  3. CCC
  4. CCC 2013
Default Cover Image

2013 IEEE Conference on Computational Complexity (CCC)

June 5 2013 to June 7 2013

Stanford, CA, USA

Table of Contents

Title Page iFreely available from IEEE.pp. i-i
[Title page iii]Freely available from IEEE.pp. iii-iii
[Copyright notice]Freely available from IEEE.pp. iv-iv
Table of ContentsFreely available from IEEE.pp. v-vii
PrefaceFreely available from IEEE.pp. viii-viii
Organizing CommitteeFreely available from IEEE.pp. ix-ix
Program CommitteeFreely available from IEEE.pp. x-x
ReviewersFreely available from IEEE.pp. xi-xi
CCC 2013 AwardsFreely available from IEEE.pp. xii-xii
Random Arithmetic Formulas Can Be Reconstructed EfficientlyFull-text access may be available. Sign in or learn about subscription options.pp. 1-9
by Ankit Gupta, Neeraj Kayal, Youming Qiao
Formulas are Exponentially Stronger than Monotone Circuits in Non-commutative SettingFull-text access may be available. Sign in or learn about subscription options.pp. 10-14
by Pavel Hrube, Amir Yehudayoff
On Medium-Uniformity and Circuit Lower BoundsFull-text access may be available. Sign in or learn about subscription options.pp. 15-23
by Rahul Santhanam, Ryan Williams
Towards a Reverse Newman's Theorem in Interactive Information ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 24-33
by Joshua Brody, Harry Buhrman, Michal Koucky, Bruno Loff, Florian Speelman, Nikolay Vereshchagin
Shared Randomness and Quantum Communication in the Multi-party ModelFull-text access may be available. Sign in or learn about subscription options.pp. 34-43
by Dmitry Gavinsky, Tsuyoshi Ito, Guoming Wang
On the Power of Non-adaptive Learning GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 44-55
by Aleksandrs Belovs, Ansis Rosmanis
The Correct Exponent for the Gotsman-Linial ConjectureFull-text access may be available. Sign in or learn about subscription options.pp. 56-64
by Daniel M. Kane
Approaching the Chasm at Depth FourFull-text access may be available. Sign in or learn about subscription options.pp. 65-73
by Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
Approximating Boolean Functions with Depth-2 CircuitsFull-text access may be available. Sign in or learn about subscription options.pp. 74-85
by Eric Blais, Li-Yang Tan
Constructing Hard Functions Using Learning AlgorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 86-97
by Adam Klivans, Pravesh Kothari, Igor C. Oliveira
Short Lists with Short Programs in Short TimeFull-text access may be available. Sign in or learn about subscription options.pp. 98-108
by Bruno Bauwens, Anton Makhlin, Nikolay Vereshchagin, Marius Zimand
Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole PrincipleFull-text access may be available. Sign in or learn about subscription options.pp. 109-120
by Albert Atserias, Moritz Muller, Sergi Oliva
LS+ Lower Bounds from Pairwise IndependenceFull-text access may be available. Sign in or learn about subscription options.pp. 121-132
by Madhur Tulsiani, Pratik Worah
Just a Pebble GameFull-text access may be available. Sign in or learn about subscription options.pp. 133-143
by Siu Man Chan
Quantum XOR GamesFull-text access may be available. Sign in or learn about subscription options.pp. 144-155
by Oded Regev, Thomas Vidick
Two-Message Quantum Interactive Proofs and the Quantum Separability ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 156-167
by Patrick Hayden, Kevin Milner, Mark M. Wilde
Collapse of the Hierarchy of Constant-Depth Exact Quantum CircuitsFull-text access may be available. Sign in or learn about subscription options.pp. 168-178
by Yasuhiro Takahashi, Seiichiro Tani
How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions?Full-text access may be available. Sign in or learn about subscription options.pp. 179-184
by Andris Ambainis, Ronald de Wolf
Composition Limits and Separating Examples for Some Boolean Function Complexity MeasuresFull-text access may be available. Sign in or learn about subscription options.pp. 185-196
by Justin Gilmer, Michael Saks, Srikanth Srinivasan
On Rigid Matrices and U-polynomialsFull-text access may be available. Sign in or learn about subscription options.pp. 197-206
by Noga Alon, Gil Cohen
Covering CSPsFull-text access may be available. Sign in or learn about subscription options.pp. 207-218
by Irit Dinur, Gillat Kol
Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex CoverFull-text access may be available. Sign in or learn about subscription options.pp. 219-229
by Sushant Sachdeva, Rishi Saket
On the Lattice Smoothing Parameter ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 230-241
by Kai-Min Chung, Daniel Dadush, Feng-Hao Liu, Chris Peikert
A Derandomized Switching Lemma and an Improved Derandomization of AC0Full-text access may be available. Sign in or learn about subscription options.pp. 242-247
by Luca Trevisan, Tongke Xue
The Distinguishability of Product Distributions by Read-Once Branching ProgramsFull-text access may be available. Sign in or learn about subscription options.pp. 248-254
by John Steinberger
Strong LTCs with Inverse Polylogarithmic Rate and SoundnessFull-text access may be available. Sign in or learn about subscription options.pp. 255-265
by Michael Viderman
On the Parameterized and Approximation Hardness of Metric DimensionFull-text access may be available. Sign in or learn about subscription options.pp. 266-276
by Sepp Hartung, Andre Nichterlein
An O(n½+?)-Space and Polynomial-Time Algorithm for Directed Planar ReachabilityFull-text access may be available. Sign in or learn about subscription options.pp. 277-286
by Tatsuya Imai, Kotaro Nakagawa, A. Pavan, N.V. Vinodchandran, Osamu Watanabe
Superlinear Lower Bounds for Multipass Graph ProcessingFull-text access may be available. Sign in or learn about subscription options.pp. 287-298
by Venkatesan Guruswami, Krzysztof Onak
Author indexFreely available from IEEE.pp. 299-299
[Publisher's information]Freely available from IEEE.pp. 300-300
Showing 40 out of 40