CCC A

37 papers

YearTitle / Authors
201631st Conference on Computational Complexity, CCC 2016, Tokyo, Japan, May 29 - June 1, 2016
Ran Raz
2016A Composition Theorem for Conical Juntas.
Mika Göös, T. S. Jayram
2016A Linear Time Algorithm for Quantum 2-SAT.
J. Niel de Beaudrap, Sevag Gharibian
2016Arithmetic Circuits with Locally Low Algebraic Rank.
Mrinal Kumar, Shubhangi Saraf
2016Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits.
Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan
2016Complexity Classification of Two-Qubit Commuting Hamiltonians.
Adam Bouland, Laura Mancinska, Xue Zhang
2016Decoding Reed-Muller Codes Over Product Sets.
John Y. Kim, Swastik Kopparty
2016Degree and Sensitivity: Tails of Two Distributions.
Parikshit Gopalan, Rocco A. Servedio, Avi Wigderson
2016Evolution and Computation (Invited Talk).
Nisheeth K. Vishnoi
2016Front Matter, Table of Contents, Preface, Awards, Conference Organization, External Reviewers.
2016Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity.
Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi
2016Harmonicity and Invariance on Slices of the Boolean Cube.
Yuval Filmus, Elchanan Mossel
2016Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs.
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
2016Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs.
Rohit Gurjar, Arpita Korwar, Nitin Saxena
2016Invariance Principle on the Slice.
Yuval Filmus, Guy Kindler, Elchanan Mossel, Karl Wimmer
2016Learning Algorithms from Natural Proofs.
Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova
2016Limits of Minimum Circuit Size Problem as Oracle.
Shuichi Hirahara, Osamu Watanabe
2016Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs.
Arnab Bhattacharyya, Sivakanth Gopi
2016Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions.
Andris Ambainis, Martins Kokainis, Robin Kothari
2016New Characterizations in Turnstile Streams with Applications.
Yuqing Ai, Wei Hu, Yi Li, David P. Woodruff
2016New Extractors for Interleaved Sources.
Eshan Chattopadhyay, David Zuckerman
2016New Hardness Results for Graph and Hypergraph Colorings.
Joshua Brakensiek, Venkatesan Guruswami
2016New Non-Uniform Lower Bounds for Uniform Classes.
Lance Fortnow, Rahul Santhanam
2016Non-Malleable Extractors - New Tools and Improved Constructions.
Gil Cohen
2016On the Sum-of-Squares Degree of Symmetric Quadratic Functions.
Troy Lee, Anupam Prakash, Ronald de Wolf, Henry Yuen
2016Polynomial Bounds for Decoupling, with Applications.
Ryan O'Donnell, Yu Zhao
2016Polynomials, Quantum Query Complexity, and Grothendieck's Inequality.
Scott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, Juris Smotrovs
2016Proof Complexity Lower Bounds from Algebraic Circuit Complexity.
Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson
2016Pseudorandomness When the Odds are Against You.
Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel
2016Reconstruction of Real Depth-3 Circuits with Top Fan-In 2.
Gaurav Sinha
2016Sculpting Quantum Speedups.
Scott Aaronson, Shalev Ben-David
2016Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation.
Richard Ryan Williams
2016Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing.
Mrinal Kumar, Shubhangi Saraf
2016Tight Bounds for Communication-Assisted Agreement Distillation.
Venkatesan Guruswami, Jaikumar Radhakrishnan
2016Tight SoS-Degree Bounds for Approximate Nash Equilibria.
Aram W. Harrow, Anand Natarajan, Xiaodi Wu
2016Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity.
Irit Dinur, Or Meir
2016Understanding PPA-Completeness.
Xiaotie Deng, Jack R. Edmonds, Zhe Feng, Zhengyang Liu, Qi Qi, Zeying Xu