32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@Proceedings{odonnell:LIPIcs.CCC.2017, title = {{LIPIcs, Volume 79, CCC'17, Complete Volume}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017}, URN = {urn:nbn:de:0030-drops-76639}, doi = {10.4230/LIPIcs.CCC.2017}, annote = {Keywords: Computation by Abstract Device} }
32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 0:i-0:xiv, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{odonnell:LIPIcs.CCC.2017.0, author = {O'Donnell, Ryan}, title = {{Front Matter, Table of Contents, Preface, Awards, Conference Organization, External Reviewers}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {0:i--0:xiv}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.0}, URN = {urn:nbn:de:0030-drops-75115}, doi = {10.4230/LIPIcs.CCC.2017.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Awards, Conference Organization, External Reviewers, List of Authors} }
Pavel Pudlák and Neil Thapen. Random Resolution Refutations. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 1:1-1:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{pudlak_et_al:LIPIcs.CCC.2017.1, author = {Pudl\'{a}k, Pavel and Thapen, Neil}, title = {{Random Resolution Refutations}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {1:1--1:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.1}, URN = {urn:nbn:de:0030-drops-75235}, doi = {10.4230/LIPIcs.CCC.2017.1}, annote = {Keywords: proof complexity, random, resolution} }
Massimo Lauria and Jakob Nordström. Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 2:1-2:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{lauria_et_al:LIPIcs.CCC.2017.2, author = {Lauria, Massimo and Nordstr\"{o}m, Jakob}, title = {{Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gr\"{o}bner Bases}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {2:1--2:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.2}, URN = {urn:nbn:de:0030-drops-75410}, doi = {10.4230/LIPIcs.CCC.2017.2}, annote = {Keywords: proof complexity, Nullstellensatz, Gr\"{o}bner basis, polynomial calculus, cutting planes, colouring} }
Mateus de Oliveira Oliveira and Pavel Pudlák. Representations of Monotone Boolean Functions by Linear Programs. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 3:1-3:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{deoliveiraoliveira_et_al:LIPIcs.CCC.2017.3, author = {de Oliveira Oliveira, Mateus and Pudl\'{a}k, Pavel}, title = {{Representations of Monotone Boolean Functions by Linear Programs}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {3:1--3:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.3}, URN = {urn:nbn:de:0030-drops-75200}, doi = {10.4230/LIPIcs.CCC.2017.3}, annote = {Keywords: Monotone Linear Programming Circuits, Lov\'{a}sz-Schrijver Proof System, Cutting-Planes Proof System, Feasible Interpolation, Lower Bounds} }
Aaron Potechin. A Note on Amortized Branching Program Complexity. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 4:1-4:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{potechin:LIPIcs.CCC.2017.4, author = {Potechin, Aaron}, title = {{A Note on Amortized Branching Program Complexity}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {4:1--4:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.4}, URN = {urn:nbn:de:0030-drops-75448}, doi = {10.4230/LIPIcs.CCC.2017.4}, annote = {Keywords: branching programs, space complexity, amortization} }
Dieter van Melkebeek and Gautam Prakriya. Derandomizing Isolation in Space-Bounded Settings. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 5:1-5:32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{vanmelkebeek_et_al:LIPIcs.CCC.2017.5, author = {van Melkebeek, Dieter and Prakriya, Gautam}, title = {{Derandomizing Isolation in Space-Bounded Settings}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {5:1--5:32}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.5}, URN = {urn:nbn:de:0030-drops-75297}, doi = {10.4230/LIPIcs.CCC.2017.5}, annote = {Keywords: Isolation lemma, derandomization, unambiguous nondeterminism, graph reachability, circuit certification} }
Danny Nguyen and Igor Pak. The Computational Complexity of Integer Programming with Alternations. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 6:1-6:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{nguyen_et_al:LIPIcs.CCC.2017.6, author = {Nguyen, Danny and Pak, Igor}, title = {{The Computational Complexity of Integer Programming with Alternations}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {6:1--6:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.6}, URN = {urn:nbn:de:0030-drops-75151}, doi = {10.4230/LIPIcs.CCC.2017.6}, annote = {Keywords: Integer Programming, Alternations, Projection of Integer Points} }
Shuichi Hirahara and Rahul Santhanam. On the Average-Case Complexity of MCSP and Its Variants. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 7:1-7:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{hirahara_et_al:LIPIcs.CCC.2017.7, author = {Hirahara, Shuichi and Santhanam, Rahul}, title = {{On the Average-Case Complexity of MCSP and Its Variants}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {7:1--7:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.7}, URN = {urn:nbn:de:0030-drops-75406}, doi = {10.4230/LIPIcs.CCC.2017.7}, annote = {Keywords: minimum circuit size problem, average-case complexity, circuit lower bounds, time-bounded Kolmogorov complexity, hardness} }
Cody D. Murray and R. Ryan Williams. Easiness Amplification and Uniform Circuit Lower Bounds. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 8:1-8:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{murray_et_al:LIPIcs.CCC.2017.8, author = {Murray, Cody D. and Williams, R. Ryan}, title = {{Easiness Amplification and Uniform Circuit Lower Bounds}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {8:1--8:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.8}, URN = {urn:nbn:de:0030-drops-75421}, doi = {10.4230/LIPIcs.CCC.2017.8}, annote = {Keywords: uniform circuit complexity, time complexity, space complexity, non-relativizing, amplification} }
Dominik Scheder and John P. Steinberger. PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 9:1-9:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{scheder_et_al:LIPIcs.CCC.2017.9, author = {Scheder, Dominik and Steinberger, John P.}, title = {{PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {9:1--9:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.9}, URN = {urn:nbn:de:0030-drops-75355}, doi = {10.4230/LIPIcs.CCC.2017.9}, annote = {Keywords: Boolean satisfiability, exponential algorithms, randomized algorithms} }
Anindya De, Elchanan Mossel, and Joe Neeman. Noise Stability Is Computable and Approximately Low-Dimensional. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 10:1-10:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{de_et_al:LIPIcs.CCC.2017.10, author = {De, Anindya and Mossel, Elchanan and Neeman, Joe}, title = {{Noise Stability Is Computable and Approximately Low-Dimensional}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {10:1--10:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.10}, URN = {urn:nbn:de:0030-drops-75390}, doi = {10.4230/LIPIcs.CCC.2017.10}, annote = {Keywords: Gaussian noise stability; Plurality is stablest; Ornstein Uhlenbeck operator} }
Mrinalkanti Ghosh and Madhur Tulsiani. From Weak to Strong LP Gaps for All CSPs. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 11:1-11:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{ghosh_et_al:LIPIcs.CCC.2017.11, author = {Ghosh, Mrinalkanti and Tulsiani, Madhur}, title = {{From Weak to Strong LP Gaps for All CSPs}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {11:1--11:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.11}, URN = {urn:nbn:de:0030-drops-75370}, doi = {10.4230/LIPIcs.CCC.2017.11}, annote = {Keywords: Constraint Satisfaction Problem, Convex Programming, Linear Programming Hierarchy, Integrality Gap} }
Mika Göös, Pritish Kamath, Toniann Pitassi, and Thomas Watson. Query-to-Communication Lifting for P^NP. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 12:1-12:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{goos_et_al:LIPIcs.CCC.2017.12, author = {G\"{o}\"{o}s, Mika and Kamath, Pritish and Pitassi, Toniann and Watson, Thomas}, title = {{Query-to-Communication Lifting for P^NP}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {12:1--12:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.12}, URN = {urn:nbn:de:0030-drops-75388}, doi = {10.4230/LIPIcs.CCC.2017.12}, annote = {Keywords: Communication Complexity, Query Complexity, Lifting Theorem, P^NP} }
Roei Tell. Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 13:1-13:48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{tell:LIPIcs.CCC.2017.13, author = {Tell, Roei}, title = {{Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {13:1--13:48}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.13}, URN = {urn:nbn:de:0030-drops-75349}, doi = {10.4230/LIPIcs.CCC.2017.13}, annote = {Keywords: Computational complexity, derandomization, quantified derandomization, hitting-set generator, constant-depth circuits} }
Elad Haramaty, Chin Ho Lee, and Emanuele Viola. Bounded Independence Plus Noise Fools Products. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 14:1-14:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{haramaty_et_al:LIPIcs.CCC.2017.14, author = {Haramaty, Elad and Lee, Chin Ho and Viola, Emanuele}, title = {{Bounded Independence Plus Noise Fools Products}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {14:1--14:30}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.14}, URN = {urn:nbn:de:0030-drops-75188}, doi = {10.4230/LIPIcs.CCC.2017.14}, annote = {Keywords: ounded independence, Noise, Product tests, Error-correcting codes, Pseudorandomness} }
Avishay Tal. Tight Bounds on the Fourier Spectrum of AC0. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 15:1-15:31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{tal:LIPIcs.CCC.2017.15, author = {Tal, Avishay}, title = {{Tight Bounds on the Fourier Spectrum of AC0}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {15:1--15:31}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.15}, URN = {urn:nbn:de:0030-drops-75258}, doi = {10.4230/LIPIcs.CCC.2017.15}, annote = {Keywords: bounded depth circuits, Fourier analysis, k-wise independence, Boolean circuits, switching lemma} }
Yuval Dagan, Yuval Filmus, Hamed Hatami, and Yaqiao Li. Trading Information Complexity for Error. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 16:1-16:59, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{dagan_et_al:LIPIcs.CCC.2017.16, author = {Dagan, Yuval and Filmus, Yuval and Hatami, Hamed and Li, Yaqiao}, title = {{Trading Information Complexity for Error}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {16:1--16:59}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.16}, URN = {urn:nbn:de:0030-drops-75179}, doi = {10.4230/LIPIcs.CCC.2017.16}, annote = {Keywords: communication complexity, information complexity} }
Alexey Milovanov and Nikolay Vereshchagin. Stochasticity in Algorithmic Statistics for Polynomial Time. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 17:1-17:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{milovanov_et_al:LIPIcs.CCC.2017.17, author = {Milovanov, Alexey and Vereshchagin, Nikolay}, title = {{Stochasticity in Algorithmic Statistics for Polynomial Time}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {17:1--17:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.17}, URN = {urn:nbn:de:0030-drops-75222}, doi = {10.4230/LIPIcs.CCC.2017.17}, annote = {Keywords: Algorithmic Statistics, Kolmogorov complexity, elusive set, distinguishing complexity} }
Igor C. Carboni Oliveira and Rahul Santhanam. Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 18:1-18:49, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{oliveira_et_al:LIPIcs.CCC.2017.18, author = {Oliveira, Igor C. Carboni and Santhanam, Rahul}, title = {{Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {18:1--18:49}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.18}, URN = {urn:nbn:de:0030-drops-75327}, doi = {10.4230/LIPIcs.CCC.2017.18}, annote = {Keywords: boolean circuits, learning theory, pseudorandomness} }
Mrinal Kumar. A Quadratic Lower Bound for Homogeneous Algebraic Branching Programs. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 19:1-19:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kumar:LIPIcs.CCC.2017.19, author = {Kumar, Mrinal}, title = {{A Quadratic Lower Bound for Homogeneous Algebraic Branching Programs}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {19:1--19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.19}, URN = {urn:nbn:de:0030-drops-75134}, doi = {10.4230/LIPIcs.CCC.2017.19}, annote = {Keywords: algebraic branching programs, arithmetic circuits, determinantal complexity, lower bounds} }
Karl Bringmann, Christian Ikenmeyer, and Jeroen Zuiddam. On Algebraic Branching Programs of Small Width. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 20:1-20:31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bringmann_et_al:LIPIcs.CCC.2017.20, author = {Bringmann, Karl and Ikenmeyer, Christian and Zuiddam, Jeroen}, title = {{On Algebraic Branching Programs of Small Width}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {20:1--20:31}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.20}, URN = {urn:nbn:de:0030-drops-75217}, doi = {10.4230/LIPIcs.CCC.2017.20}, annote = {Keywords: algebraic branching programs, algebraic complexity theory, border complexity, formula size, iterated matrix multiplication} }
Neeraj Kayal, Vineet Nair, Chandan Saha, and Sébastien Tavenas. Reconstruction of Full Rank Algebraic Branching Programs. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 21:1-21:61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kayal_et_al:LIPIcs.CCC.2017.21, author = {Kayal, Neeraj and Nair, Vineet and Saha, Chandan and Tavenas, S\'{e}bastien}, title = {{Reconstruction of Full Rank Algebraic Branching Programs}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {21:1--21:61}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.21}, URN = {urn:nbn:de:0030-drops-75318}, doi = {10.4230/LIPIcs.CCC.2017.21}, annote = {Keywords: Circuit reconstruction, algebraic branching programs, equivalence test, iterated matrix multiplication, Lie algebra} }
Scott Aaronson and Lijie Chen. Complexity-Theoretic Foundations of Quantum Supremacy Experiments. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 22:1-22:67, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{aaronson_et_al:LIPIcs.CCC.2017.22, author = {Aaronson, Scott and Chen, Lijie}, title = {{Complexity-Theoretic Foundations of Quantum Supremacy Experiments}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {22:1--22:67}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.22}, URN = {urn:nbn:de:0030-drops-75274}, doi = {10.4230/LIPIcs.CCC.2017.22}, annote = {Keywords: computational complexity, quantum computing, quantum supremacy} }
Ashwin Nayak and Dave Touchette. Augmented Index and Quantum Streaming Algorithms for DYCK(2). In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 23:1-23:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{nayak_et_al:LIPIcs.CCC.2017.23, author = {Nayak, Ashwin and Touchette, Dave}, title = {{Augmented Index and Quantum Streaming Algorithms for DYCK(2)}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {23:1--23:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.23}, URN = {urn:nbn:de:0030-drops-75437}, doi = {10.4230/LIPIcs.CCC.2017.23}, annote = {Keywords: Quantum streaming algorithms, Space complexity, Quantum communication complexity, Quantum information cost, DYCK(2), Augmented Index} }
Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, and Troy Lee. Separating Quantum Communication and Approximate Rank. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 24:1-24:33, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{anshu_et_al:LIPIcs.CCC.2017.24, author = {Anshu, Anurag and Ben-David, Shalev and Garg, Ankit and Jain, Rahul and Kothari, Robin and Lee, Troy}, title = {{Separating Quantum Communication and Approximate Rank}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {24:1--24:33}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.24}, URN = {urn:nbn:de:0030-drops-75303}, doi = {10.4230/LIPIcs.CCC.2017.24}, annote = {Keywords: Communication Complexity, Quantum Computing, Lower Bounds, logrank, Quantum Information} }
Srinivasan Arunachalam and Ronald de Wolf. Optimal Quantum Sample Complexity of Learning Algorithms. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 25:1-25:31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{arunachalam_et_al:LIPIcs.CCC.2017.25, author = {Arunachalam, Srinivasan and de Wolf, Ronald}, title = {{Optimal Quantum Sample Complexity of Learning Algorithms}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {25:1--25:31}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.25}, URN = {urn:nbn:de:0030-drops-75241}, doi = {10.4230/LIPIcs.CCC.2017.25}, annote = {Keywords: Quantum computing, PAC learning, agnostic learning, VC dimension} }
Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, and Jinyu Xie. Settling the Query Complexity of Non-Adaptive Junta Testing. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 26:1-26:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{chen_et_al:LIPIcs.CCC.2017.26, author = {Chen, Xi and Servedio, Rocco A. and Tan, Li-Yang and Waingarten, Erik and Xie, Jinyu}, title = {{Settling the Query Complexity of Non-Adaptive Junta Testing}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {26:1--26:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.26}, URN = {urn:nbn:de:0030-drops-75283}, doi = {10.4230/LIPIcs.CCC.2017.26}, annote = {Keywords: property testing, juntas, query complexity} }
Clément L. Canonne and Tom Gur. An Adaptivity Hierarchy Theorem for Property Testing. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 27:1-27:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{canonne_et_al:LIPIcs.CCC.2017.27, author = {Canonne, Cl\'{e}ment L. and Gur, Tom}, title = {{An Adaptivity Hierarchy Theorem for Property Testing}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {27:1--27:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.27}, URN = {urn:nbn:de:0030-drops-75164}, doi = {10.4230/LIPIcs.CCC.2017.27}, annote = {Keywords: Property Testing, Coding Theory, Hierarchy Theorems} }
Eric Blais, Clément L. Canonne, and Tom Gur. Distribution Testing Lower Bounds via Reductions from Communication Complexity. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 28:1-28:40, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{blais_et_al:LIPIcs.CCC.2017.28, author = {Blais, Eric and Canonne, Cl\'{e}ment L. and Gur, Tom}, title = {{Distribution Testing Lower Bounds via Reductions from Communication Complexity}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {28:1--28:40}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.28}, URN = {urn:nbn:de:0030-drops-75366}, doi = {10.4230/LIPIcs.CCC.2017.28}, annote = {Keywords: Distribution testing, communication complexity, lower bounds, simultaneous message passing, functional analysis} }
Irit Dinur and Inbal Livni Navon. Exponentially Small Soundness for the Direct Product Z-Test. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 29:1-29:50, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{dinur_et_al:LIPIcs.CCC.2017.29, author = {Dinur, Irit and Livni Navon, Inbal}, title = {{Exponentially Small Soundness for the Direct Product Z-Test}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {29:1--29:50}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.29}, URN = {urn:nbn:de:0030-drops-75336}, doi = {10.4230/LIPIcs.CCC.2017.29}, annote = {Keywords: Direct Product Testing, Property Testing, Agreement} }
Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, and Siyi Yang. On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 30:1-30:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{belovs_et_al:LIPIcs.CCC.2017.30, author = {Belovs, Aleksandrs and Ivanyos, G\'{a}bor and Qiao, Youming and Santha, Miklos and Yang, Siyi}, title = {{On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {30:1--30:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.30}, URN = {urn:nbn:de:0030-drops-75260}, doi = {10.4230/LIPIcs.CCC.2017.30}, annote = {Keywords: Chevalley-Warning Theorem, Combinatorail Nullstellensatz, Polynomial Parity Argument, arithmetic circuit} }
Mrinal Kumar and Ramprasad Saptharishi. An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 31:1-31:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kumar_et_al:LIPIcs.CCC.2017.31, author = {Kumar, Mrinal and Saptharishi, Ramprasad}, title = {{An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {31:1--31:30}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.31}, URN = {urn:nbn:de:0030-drops-75142}, doi = {10.4230/LIPIcs.CCC.2017.31}, annote = {Keywords: arithmetic circuits, lower bounds, separations, depth reduction} }
Daniel Minahan and Ilya Volkovich. Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 32:1-32:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{minahan_et_al:LIPIcs.CCC.2017.32, author = {Minahan, Daniel and Volkovich, Ilya}, title = {{Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {32:1--32:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.32}, URN = {urn:nbn:de:0030-drops-75128}, doi = {10.4230/LIPIcs.CCC.2017.32}, annote = {Keywords: Derandomization, Read-Once Formulas, Identity Testing, Arithmetic Circuits, Reconstruction} }
Markus Blaeser, Gorav Jindal, and Anurag Pandey. Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 33:1-33:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{blaeser_et_al:LIPIcs.CCC.2017.33, author = {Blaeser, Markus and Jindal, Gorav and Pandey, Anurag}, title = {{Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {33:1--33:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-040-8}, ISSN = {1868-8969}, year = {2017}, volume = {79}, editor = {O'Donnell, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.33}, URN = {urn:nbn:de:0030-drops-75194}, doi = {10.4230/LIPIcs.CCC.2017.33}, annote = {Keywords: Commutative Rank, Matrix Spaces, PTAS, Wong sequences} }
Feedback for Dagstuhl Publishing