@Proceedings{raz:LIPIcs.CCC.2016,
title = {{LIPIcs, Volume 50, CCC'16, Complete Volume}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016},
URN = {urn:nbn:de:0030-drops-58590},
doi = {10.4230/LIPIcs.CCC.2016},
annote = {Keywords: Theory of Computation}
}
@InProceedings{raz:LIPIcs.CCC.2016.0,
author = {Raz, Ran},
title = {{Front Matter, Table of Contents, Preface, Awards, Conference Organization, External Reviewers}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.0},
URN = {urn:nbn:de:0030-drops-58227},
doi = {10.4230/LIPIcs.CCC.2016.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Awards, Conference Organization, External Reviewers}
}
@InProceedings{chen_et_al:LIPIcs.CCC.2016.1,
author = {Chen, Ruiwen and Santhanam, Rahul and Srinivasan, Srikanth},
title = {{Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {1:1--1:35},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.1},
URN = {urn:nbn:de:0030-drops-58447},
doi = {10.4230/LIPIcs.CCC.2016.1},
annote = {Keywords: threshold circuit, satisfiability algorithm, circuit lower bound}
}
@InProceedings{williams:LIPIcs.CCC.2016.2,
author = {Williams, Richard Ryan},
title = {{Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {2:1--2:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.2},
URN = {urn:nbn:de:0030-drops-58307},
doi = {10.4230/LIPIcs.CCC.2016.2},
annote = {Keywords: counting complexity, exponential-time hypothesis, interactive proofs, Merlin-Arthur games}
}
@InProceedings{dinur_et_al:LIPIcs.CCC.2016.3,
author = {Dinur, Irit and Meir, Or},
title = {{Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {3:1--3:51},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.3},
URN = {urn:nbn:de:0030-drops-58412},
doi = {10.4230/LIPIcs.CCC.2016.3},
annote = {Keywords: Formula lower bounds, communication complexity, Karchmer-Wigderson games, KRW composition conjecture}
}
@InProceedings{ambainis_et_al:LIPIcs.CCC.2016.4,
author = {Ambainis, Andris and Kokainis, Martins and Kothari, Robin},
title = {{Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {4:1--4:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.4},
URN = {urn:nbn:de:0030-drops-58471},
doi = {10.4230/LIPIcs.CCC.2016.4},
annote = {Keywords: Query Complexity, Communication Complexity, Subcube Partition Complexity, Partition Bound}
}
@InProceedings{goos_et_al:LIPIcs.CCC.2016.5,
author = {G\"{o}\"{o}s, Mika and Jayram, T. S.},
title = {{A Composition Theorem for Conical Juntas}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {5:1--5:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.5},
URN = {urn:nbn:de:0030-drops-58497},
doi = {10.4230/LIPIcs.CCC.2016.5},
annote = {Keywords: Composition theorems, conical juntas}
}
@InProceedings{guruswami_et_al:LIPIcs.CCC.2016.6,
author = {Guruswami, Venkatesan and Radhakrishnan, Jaikumar},
title = {{Tight Bounds for Communication-Assisted Agreement Distillation}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {6:1--6:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.6},
URN = {urn:nbn:de:0030-drops-58450},
doi = {10.4230/LIPIcs.CCC.2016.6},
annote = {Keywords: communication complexity, covering codes, hypercontractivity, information theory, lower bounds, pseudorandomness}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.CCC.2016.7,
author = {Chattopadhyay, Eshan and Zuckerman, David},
title = {{New Extractors for Interleaved Sources}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {7:1--7:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.7},
URN = {urn:nbn:de:0030-drops-58513},
doi = {10.4230/LIPIcs.CCC.2016.7},
annote = {Keywords: extractor, derandomization, explicit construction}
}
@InProceedings{cohen:LIPIcs.CCC.2016.8,
author = {Cohen, Gil},
title = {{Non-Malleable Extractors - New Tools and Improved Constructions}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {8:1--8:29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.8},
URN = {urn:nbn:de:0030-drops-58348},
doi = {10.4230/LIPIcs.CCC.2016.8},
annote = {Keywords: extractors, non-malleable, explicit constructions}
}
@InProceedings{artemenko_et_al:LIPIcs.CCC.2016.9,
author = {Artemenko, Sergei and Impagliazzo, Russell and Kabanets, Valentine and Shaltiel, Ronen},
title = {{Pseudorandomness When the Odds are Against You}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {9:1--9:35},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.9},
URN = {urn:nbn:de:0030-drops-58375},
doi = {10.4230/LIPIcs.CCC.2016.9},
annote = {Keywords: Derandomization, pseudorandom generator, hitting-set generator, relative error}
}
@InProceedings{carmosino_et_al:LIPIcs.CCC.2016.10,
author = {Carmosino, Marco L. and Impagliazzo, Russell and Kabanets, Valentine and Kolokolova, Antonina},
title = {{Learning Algorithms from Natural Proofs}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {10:1--10:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.10},
URN = {urn:nbn:de:0030-drops-58557},
doi = {10.4230/LIPIcs.CCC.2016.10},
annote = {Keywords: natural proofs, circuit complexity, lower bounds, learning, compression}
}
@InProceedings{kim_et_al:LIPIcs.CCC.2016.11,
author = {Kim, John Y. and Kopparty, Swastik},
title = {{Decoding Reed-Muller Codes Over Product Sets}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {11:1--11:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.11},
URN = {urn:nbn:de:0030-drops-58352},
doi = {10.4230/LIPIcs.CCC.2016.11},
annote = {Keywords: polynomial codes, Reed-Muller codes, coding theory, error-correcting codes}
}
@InProceedings{bhattacharyya_et_al:LIPIcs.CCC.2016.12,
author = {Bhattacharyya, Arnab and Gopi, Sivakanth},
title = {{Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.12},
URN = {urn:nbn:de:0030-drops-58400},
doi = {10.4230/LIPIcs.CCC.2016.12},
annote = {Keywords: Locally correctable code, Locally testable code, Affine Invariance, Gowers uniformity norm}
}
@InProceedings{gopalan_et_al:LIPIcs.CCC.2016.13,
author = {Gopalan, Parikshit and Servedio, Rocco A. and Wigderson, Avi},
title = {{Degree and Sensitivity: Tails of Two Distributions}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {13:1--13:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.13},
URN = {urn:nbn:de:0030-drops-58488},
doi = {10.4230/LIPIcs.CCC.2016.13},
annote = {Keywords: Boolean functions, random restrictions, Fourier analysis}
}
@InProceedings{brakensiek_et_al:LIPIcs.CCC.2016.14,
author = {Brakensiek, Joshua and Guruswami, Venkatesan},
title = {{New Hardness Results for Graph and Hypergraph Colorings}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {14:1--14:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.14},
URN = {urn:nbn:de:0030-drops-58291},
doi = {10.4230/LIPIcs.CCC.2016.14},
annote = {Keywords: hardness of approximation, graph coloring, hypergraph coloring, polymor- phisms, combinatorics}
}
@InProceedings{filmus_et_al:LIPIcs.CCC.2016.15,
author = {Filmus, Yuval and Kindler, Guy and Mossel, Elchanan and Wimmer, Karl},
title = {{Invariance Principle on the Slice}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {15:1--15:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.15},
URN = {urn:nbn:de:0030-drops-58236},
doi = {10.4230/LIPIcs.CCC.2016.15},
annote = {Keywords: analysis of boolean functions, invariance principle, Johnson association scheme, the slice}
}
@InProceedings{filmus_et_al:LIPIcs.CCC.2016.16,
author = {Filmus, Yuval and Mossel, Elchanan},
title = {{Harmonicity and Invariance on Slices of the Boolean Cube}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {16:1--16:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.16},
URN = {urn:nbn:de:0030-drops-58240},
doi = {10.4230/LIPIcs.CCC.2016.16},
annote = {Keywords: analysis of boolean functions, invariance principle, Johnson association scheme, the slice}
}
@InProceedings{lee_et_al:LIPIcs.CCC.2016.17,
author = {Lee, Troy and Prakash, Anupam and de Wolf, Ronald and Yuen, Henry},
title = {{On the Sum-of-Squares Degree of Symmetric Quadratic Functions}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {17:1--17:31},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.17},
URN = {urn:nbn:de:0030-drops-58383},
doi = {10.4230/LIPIcs.CCC.2016.17},
annote = {Keywords: Sum-of-squares degree, approximation theory, Positivstellensatz refutations of knapsack, quantum query complexity in expectation, extension complexity}
}
@InProceedings{hirahara_et_al:LIPIcs.CCC.2016.18,
author = {Hirahara, Shuichi and Watanabe, Osamu},
title = {{Limits of Minimum Circuit Size Problem as Oracle}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {18:1--18:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.18},
URN = {urn:nbn:de:0030-drops-58426},
doi = {10.4230/LIPIcs.CCC.2016.18},
annote = {Keywords: minimum circuit size problem, NP-completeness, randomized reductions, resource-bounded Kolmogorov complexity, Turing reductions}
}
@InProceedings{fortnow_et_al:LIPIcs.CCC.2016.19,
author = {Fortnow, Lance and Santhanam, Rahul},
title = {{New Non-Uniform Lower Bounds for Uniform Classes}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.19},
URN = {urn:nbn:de:0030-drops-58503},
doi = {10.4230/LIPIcs.CCC.2016.19},
annote = {Keywords: Computational complexity, nondeterminism, nonuniform complexity}
}
@InProceedings{ai_et_al:LIPIcs.CCC.2016.20,
author = {Ai, Yuqing and Hu, Wei and Li, Yi and Woodruff, David P.},
title = {{New Characterizations in Turnstile Streams with Applications}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {20:1--20:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.20},
URN = {urn:nbn:de:0030-drops-58337},
doi = {10.4230/LIPIcs.CCC.2016.20},
annote = {Keywords: communication complexity, data streams, dynamic graph streams, norm estimation}
}
@InProceedings{vishnoi:LIPIcs.CCC.2016.21,
author = {Vishnoi, Nisheeth K.},
title = {{Evolution and Computation}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {21:1--21:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.21},
URN = {urn:nbn:de:0030-drops-58576},
doi = {10.4230/LIPIcs.CCC.2016.21},
annote = {Keywords: Evolution, Dynamical Systems, Algorithms, Complexity}
}
@InProceedings{harrow_et_al:LIPIcs.CCC.2016.22,
author = {Harrow, Aram and Natarajan, Anand V. and Wu, Xiaodi},
title = {{Tight SoS-Degree Bounds for Approximate Nash Equilibria}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {22:1--22:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.22},
URN = {urn:nbn:de:0030-drops-58565},
doi = {10.4230/LIPIcs.CCC.2016.22},
annote = {Keywords: Approximate Nash Equilibrium, Sum of Squares, LP, SDP}
}
@InProceedings{deng_et_al:LIPIcs.CCC.2016.23,
author = {Deng, Xiaotie and Edmonds, Jack R. and Feng, Zhe and Liu, Zhengyang and Qi, Qi and Xu, Zeying},
title = {{Understanding PPA-Completeness}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {23:1--23:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.23},
URN = {urn:nbn:de:0030-drops-58310},
doi = {10.4230/LIPIcs.CCC.2016.23},
annote = {Keywords: Fixed Point Computation, PPA-Completeness}
}
@InProceedings{odonnell_et_al:LIPIcs.CCC.2016.24,
author = {O'Donnell, Ryan and Zhao, Yu},
title = {{Polynomial Bounds for Decoupling, with Applications}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {24:1--24:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.24},
URN = {urn:nbn:de:0030-drops-58520},
doi = {10.4230/LIPIcs.CCC.2016.24},
annote = {Keywords: Decoupling, Query Complexity, Fourier Analysis, Boolean Functions}
}
@InProceedings{aaronson_et_al:LIPIcs.CCC.2016.25,
author = {Aaronson, Scott and Ambainis, Andris and Iraids, Janis and Kokainis, Martins and Smotrovs, Juris},
title = {{Polynomials, Quantum Query Complexity, and Grothendieck's Inequality}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {25:1--25:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.25},
URN = {urn:nbn:de:0030-drops-58394},
doi = {10.4230/LIPIcs.CCC.2016.25},
annote = {Keywords: quantum algorithms, Boolean functions, approximation by polynomials, Grothendieck's inequality}
}
@InProceedings{aaronson_et_al:LIPIcs.CCC.2016.26,
author = {Aaronson, Scott and Ben-David, Shalev},
title = {{Sculpting Quantum Speedups}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {26:1--26:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.26},
URN = {urn:nbn:de:0030-drops-58538},
doi = {10.4230/LIPIcs.CCC.2016.26},
annote = {Keywords: Quantum Computing, Query Complexity, Decision Tree Complexity, Structural Complexity}
}
@InProceedings{debeaudrap_et_al:LIPIcs.CCC.2016.27,
author = {de Beaudrap, Niel and Gharibian, Sevag},
title = {{A Linear Time Algorithm for Quantum 2-SAT}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {27:1--27:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.27},
URN = {urn:nbn:de:0030-drops-58363},
doi = {10.4230/LIPIcs.CCC.2016.27},
annote = {Keywords: quantum 2-SAT, transfer matrix, strongly connected components, limited backtracking, local Hamiltonian}
}
@InProceedings{bouland_et_al:LIPIcs.CCC.2016.28,
author = {Bouland, Adam and Mancinska, Laura and Zhang, Xue},
title = {{Complexity Classification of Two-Qubit Commuting Hamiltonians}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {28:1--28:33},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.28},
URN = {urn:nbn:de:0030-drops-58469},
doi = {10.4230/LIPIcs.CCC.2016.28},
annote = {Keywords: Quantum Computing, Sampling Problems, Commuting Hamiltonians, IQP, Gate Classification Theorems}
}
@InProceedings{gurjar_et_al:LIPIcs.CCC.2016.29,
author = {Gurjar, Rohit and Korwar, Arpita and Saxena, Nitin},
title = {{Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {29:1--29:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.29},
URN = {urn:nbn:de:0030-drops-58438},
doi = {10.4230/LIPIcs.CCC.2016.29},
annote = {Keywords: PIT, hitting-set, constant-width ROABPs, commutative ROABPs}
}
@InProceedings{anderson_et_al:LIPIcs.CCC.2016.30,
author = {Anderson, Matthew and Forbes, Michael A. and Saptharishi, Ramprasad and Shpilka, Amir and Volk, Ben Lee},
title = {{Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {30:1--30:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.30},
URN = {urn:nbn:de:0030-drops-58255},
doi = {10.4230/LIPIcs.CCC.2016.30},
annote = {Keywords: Algebraic Complexity, Lower Bounds, Derandomization, Polynomial Identity Testing}
}
@InProceedings{sinha:LIPIcs.CCC.2016.31,
author = {Sinha, Gaurav},
title = {{Reconstruction of Real Depth-3 Circuits with Top Fan-In 2}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {31:1--31:53},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.31},
URN = {urn:nbn:de:0030-drops-58545},
doi = {10.4230/LIPIcs.CCC.2016.31},
annote = {Keywords: Reconstruction, SigmaPiSigma(2), Sylvester-Gallai, Brill's Equations}
}
@InProceedings{forbes_et_al:LIPIcs.CCC.2016.32,
author = {Forbes, Michael A. and Shpilka, Amir and Tzameret, Iddo and Wigderson, Avi},
title = {{Proof Complexity Lower Bounds from Algebraic Circuit Complexity}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {32:1--32:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.32},
URN = {urn:nbn:de:0030-drops-58321},
doi = {10.4230/LIPIcs.CCC.2016.32},
annote = {Keywords: Proof Complexity, Algebraic Complexity, Nullstellensatz, Subset-Sum}
}
@InProceedings{forbes_et_al:LIPIcs.CCC.2016.33,
author = {Forbes, Michael A. and Kumar, Mrinal and Saptharishi, Ramprasad},
title = {{Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {33:1--33:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.33},
URN = {urn:nbn:de:0030-drops-58266},
doi = {10.4230/LIPIcs.CCC.2016.33},
annote = {Keywords: boolean circuits, arithmetic circuits, lower bounds, functional computation}
}
@InProceedings{kumar_et_al:LIPIcs.CCC.2016.34,
author = {Kumar, Mrinal and Saraf, Shubhangi},
title = {{Arithmetic Circuits with Locally Low Algebraic Rank}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {34:1--34:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.34},
URN = {urn:nbn:de:0030-drops-58288},
doi = {10.4230/LIPIcs.CCC.2016.34},
annote = {Keywords: algebraic independence, arithmetic circuits, lower bounds}
}
@InProceedings{kumar_et_al:LIPIcs.CCC.2016.35,
author = {Kumar, Mrinal and Saraf, Shubhangi},
title = {{Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {35:1--35:29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.35},
URN = {urn:nbn:de:0030-drops-58270},
doi = {10.4230/LIPIcs.CCC.2016.35},
annote = {Keywords: arithmetic circuits, lower bounds, polynomial identity testing, hardness vs randomness}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing