LIPIcs, Volume 50, CCC 2016

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