@Proceedings{zuckerman:LIPIcs.CCC.2015,
title = {{LIPIcs, Volume 33, CCC'15, Complete Volume}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015},
URN = {urn:nbn:de:0030-drops-52111},
doi = {10.4230/LIPIcs.CCC.2015},
annote = {Keywords: Theory of Computation}
}
@InProceedings{zuckerman:LIPIcs.CCC.2015.i,
author = {Zuckerman, David},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {i--xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.i},
URN = {urn:nbn:de:0030-drops-50790},
doi = {10.4230/LIPIcs.CCC.2015.i},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{goldreich_et_al:LIPIcs.CCC.2015.1,
author = {Goldreich, Oded and Gur, Tom and Komargodski, Ilan},
title = {{Strong Locally Testable Codes with Relaxed Local Decoders}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {1--41},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.1},
URN = {urn:nbn:de:0030-drops-50507},
doi = {10.4230/LIPIcs.CCC.2015.1},
annote = {Keywords: Locally Testable Codes, Locally Decodable Codes, PCPs of Proximity}
}
@InProceedings{guruswami_et_al:LIPIcs.CCC.2015.42,
author = {Guruswami, Venkatesan and Velingker, Ameya},
title = {{An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {42--57},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.42},
URN = {urn:nbn:de:0030-drops-50755},
doi = {10.4230/LIPIcs.CCC.2015.42},
annote = {Keywords: Polar codes, polynomial gap to capacity, entropy sumset inequality, arbitrary alphabets}
}
@InProceedings{haviv_et_al:LIPIcs.CCC.2015.58,
author = {Haviv, Ishay and Regev, Oded},
title = {{The List-Decoding Size of Fourier-Sparse Boolean Functions}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {58--71},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.58},
URN = {urn:nbn:de:0030-drops-50600},
doi = {10.4230/LIPIcs.CCC.2015.58},
annote = {Keywords: Fourier-sparse functions, list-decoding, learning theory, property testing}
}
@InProceedings{bhowmick_et_al:LIPIcs.CCC.2015.72,
author = {Bhowmick, Abhishek and Lovett, Shachar},
title = {{Nonclassical Polynomials as a Barrier to Polynomial Lower Bounds}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {72--87},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.72},
URN = {urn:nbn:de:0030-drops-50491},
doi = {10.4230/LIPIcs.CCC.2015.72},
annote = {Keywords: nonclassical polynomials, polynomials, lower bounds, barrier}
}
@InProceedings{rao_et_al:LIPIcs.CCC.2015.88,
author = {Rao, Anup and Yehudayoff, Amir},
title = {{Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {88--101},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.88},
URN = {urn:nbn:de:0030-drops-50769},
doi = {10.4230/LIPIcs.CCC.2015.88},
annote = {Keywords: communication complexity, set disjointness, number on forehead, lower bounds}
}
@InProceedings{natarajanramamoorthy_et_al:LIPIcs.CCC.2015.102,
author = {Natarajan Ramamoorthy, Sivaramakrishnan and Rao, Anup},
title = {{How to Compress Asymmetric Communication}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {102--123},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.102},
URN = {urn:nbn:de:0030-drops-50679},
doi = {10.4230/LIPIcs.CCC.2015.102},
annote = {Keywords: Communication Complexity, Interactive Compression, Information Complexity}
}
@InProceedings{oliveira_et_al:LIPIcs.CCC.2015.124,
author = {Oliveira, Igor Carboni and Santhanam, Rahul},
title = {{Majority is Incompressible by AC^0\lbrackp\rbrack Circuits}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {124--157},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.124},
URN = {urn:nbn:de:0030-drops-50658},
doi = {10.4230/LIPIcs.CCC.2015.124},
annote = {Keywords: interactive communication, compression, circuit lower bound}
}
@InProceedings{kayal_et_al:LIPIcs.CCC.2015.158,
author = {Kayal, Neeraj and Saha, Chandan},
title = {{Lower Bounds for Depth Three Arithmetic Circuits with Small Bottom Fanin}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {158--182},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.158},
URN = {urn:nbn:de:0030-drops-50617},
doi = {10.4230/LIPIcs.CCC.2015.158},
annote = {Keywords: arithmetic circuits, depth three circuits, lower bound, bottom fanin}
}
@InProceedings{bera_et_al:LIPIcs.CCC.2015.183,
author = {Bera, Suman K. and Chakrabarti, Amit},
title = {{A Depth-Five Lower Bound for Iterated Matrix Multiplication}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {183--197},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.183},
URN = {urn:nbn:de:0030-drops-50622},
doi = {10.4230/LIPIcs.CCC.2015.183},
annote = {Keywords: arithmetic circuits, iterated matrix multiplication, depth five circuits, lower bound}
}
@InProceedings{oliveira:LIPIcs.CCC.2015.198,
author = {Oliveira, Rafael},
title = {{Factors of Low Individual Degree Polynomials}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {198--216},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.198},
URN = {urn:nbn:de:0030-drops-50594},
doi = {10.4230/LIPIcs.CCC.2015.198},
annote = {Keywords: Arithmetic Circuits, Factoring, Algebraic Complexity}
}
@InProceedings{chakrabarti_et_al:LIPIcs.CCC.2015.217,
author = {Chakrabarti, Amit and Cormode, Graham and McGregor, Andrew and Thaler, Justin and Venkatasubramanian, Suresh},
title = {{Verifiable Stream Computation and Arthur–Merlin Communication}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {217--243},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.217},
URN = {urn:nbn:de:0030-drops-50680},
doi = {10.4230/LIPIcs.CCC.2015.217},
annote = {Keywords: Arthur-Merlin communication complexity, streaming interactive proofs}
}
@InProceedings{hirahara:LIPIcs.CCC.2015.244,
author = {Hirahara, Shuichi},
title = {{Identifying an Honest EXP^NP Oracle Among Many}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {244--263},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.244},
URN = {urn:nbn:de:0030-drops-50718},
doi = {10.4230/LIPIcs.CCC.2015.244},
annote = {Keywords: nonuniform complexity, short advice, instance checker, interactive proof systems, probabilistic checkable proofs}
}
@InProceedings{servedio_et_al:LIPIcs.CCC.2015.264,
author = {Servedio, Rocco A. and Tan, Li-Yang and Wright, John},
title = {{Adaptivity Helps for Testing Juntas}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {264--279},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.264},
URN = {urn:nbn:de:0030-drops-50663},
doi = {10.4230/LIPIcs.CCC.2015.264},
annote = {Keywords: Property testing, juntas, adaptivity}
}
@InProceedings{bhangale_et_al:LIPIcs.CCC.2015.280,
author = {Bhangale, Amey and Harsha, Prahladh and Varma, Girish},
title = {{A Characterization of Hard-to-cover CSPs}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {280--303},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.280},
URN = {urn:nbn:de:0030-drops-50574},
doi = {10.4230/LIPIcs.CCC.2015.280},
annote = {Keywords: CSPs, Covering Problem, Hardness of Approximation, Unique Games, Invariance Principle}
}
@InProceedings{oliveira_et_al:LIPIcs.CCC.2015.304,
author = {Oliveira, Rafael and Shpilka, Amir and Volk, Ben Lee},
title = {{Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {304--322},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.304},
URN = {urn:nbn:de:0030-drops-50548},
doi = {10.4230/LIPIcs.CCC.2015.304},
annote = {Keywords: Arithmetic Circuits, Derandomization, Polynomial Identity Testing}
}
@InProceedings{gurjar_et_al:LIPIcs.CCC.2015.323,
author = {Gurjar, Rohit and Korwar, Arpita and Saxena, Nitin and Thierauf, Thomas},
title = {{Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {323--346},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.323},
URN = {urn:nbn:de:0030-drops-50647},
doi = {10.4230/LIPIcs.CCC.2015.323},
annote = {Keywords: PIT, Hitting-set, Sum of ROABPs, Evaluation Dimension, Rank Concentration}
}
@InProceedings{samorodnitsky_et_al:LIPIcs.CCC.2015.347,
author = {Samorodnitsky, Alex and Shkredov, Ilya and Yekhanin, Sergey},
title = {{Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {347--364},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.347},
URN = {urn:nbn:de:0030-drops-50703},
doi = {10.4230/LIPIcs.CCC.2015.347},
annote = {Keywords: Matrix rigidity, linear codes, Kolmogorov width}
}
@InProceedings{murray_et_al:LIPIcs.CCC.2015.365,
author = {Murray, Cody D. and Williams, R. Ryan},
title = {{On the (Non) NP-Hardness of Computing Circuit Complexity}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {365--380},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.365},
URN = {urn:nbn:de:0030-drops-50745},
doi = {10.4230/LIPIcs.CCC.2015.365},
annote = {Keywords: circuit lower bounds, Minimum Circuit Size Problem, NP-completeness, projections, Reductions}
}
@InProceedings{hrubes_et_al:LIPIcs.CCC.2015.381,
author = {Hrubes, Pavel and Rao, Anup},
title = {{Circuits with Medium Fan-In}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {381--391},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.381},
URN = {urn:nbn:de:0030-drops-50528},
doi = {10.4230/LIPIcs.CCC.2015.381},
annote = {Keywords: Boolean circuit, Complexity, Communication Complexity}
}
@InProceedings{rossman:LIPIcs.CCC.2015.392,
author = {Rossman, Benjamin},
title = {{Correlation Bounds Against Monotone NC^1}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {392--411},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.392},
URN = {urn:nbn:de:0030-drops-50785},
doi = {10.4230/LIPIcs.CCC.2015.392},
annote = {Keywords: circuit complexity, average-case complexity}
}
@InProceedings{li_et_al:LIPIcs.CCC.2015.412,
author = {Li, Fu and Tzameret, Iddo and Wang, Zhengyu},
title = {{Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {412--432},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.412},
URN = {urn:nbn:de:0030-drops-50585},
doi = {10.4230/LIPIcs.CCC.2015.412},
annote = {Keywords: Proof complexity, algebraic complexity, arithmetic circuits, Frege, non-commutative formulas}
}
@InProceedings{galesi_et_al:LIPIcs.CCC.2015.433,
author = {Galesi, Nicola and Pudl\'{a}k, Pavel and Thapen, Neil},
title = {{The Space Complexity of Cutting Planes Refutations}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {433--447},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.433},
URN = {urn:nbn:de:0030-drops-50551},
doi = {10.4230/LIPIcs.CCC.2015.433},
annote = {Keywords: Proof Complexity, Cutting Planes, Space Complexity}
}
@InProceedings{lauria_et_al:LIPIcs.CCC.2015.448,
author = {Lauria, Massimo and Nordstr\"{o}m, Jakob},
title = {{Tight Size-Degree Bounds for Sums-of-Squares Proofs}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {448--466},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.448},
URN = {urn:nbn:de:0030-drops-50736},
doi = {10.4230/LIPIcs.CCC.2015.448},
annote = {Keywords: Proof complexity, resolution, Lasserre, Positivstellensatz, sums-of-squares, SOS, semidefinite programming, size, degree, rank, clique, lower bound}
}
@InProceedings{miksa_et_al:LIPIcs.CCC.2015.467,
author = {Miksa, Mladen and Nordstr\"{o}m, Jakob},
title = {{A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {467--487},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.467},
URN = {urn:nbn:de:0030-drops-50775},
doi = {10.4230/LIPIcs.CCC.2015.467},
annote = {Keywords: proof complexity, polynomial calculus, polynomial calculus resolution, PCR, degree, size, functional pigeonhole principle, lower bound}
}
@InProceedings{kobayashi_et_al:LIPIcs.CCC.2015.488,
author = {Kobayashi, Hirotada and Le Gall, Francois and Nishimura, Harumichi},
title = {{Generalized Quantum Arthur-Merlin Games}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {488--511},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.488},
URN = {urn:nbn:de:0030-drops-50697},
doi = {10.4230/LIPIcs.CCC.2015.488},
annote = {Keywords: interactive proof systems, Arthur-Merlin games, quantum computing, complete problems, entanglement}
}
@InProceedings{chung_et_al:LIPIcs.CCC.2015.512,
author = {Chung, Kai-Min and Wu, Xiaodi and Yuen, Henry},
title = {{Parallel Repetition for Entangled k-player Games via Fast Quantum Search}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {512--536},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.512},
URN = {urn:nbn:de:0030-drops-50727},
doi = {10.4230/LIPIcs.CCC.2015.512},
annote = {Keywords: Parallel repetition, quantum entanglement, communication complexity}
}
@InProceedings{lin_et_al:LIPIcs.CCC.2015.537,
author = {Lin, Cedric Yen-Yu and Lin, Han-Hsuan},
title = {{Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {537--566},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.537},
URN = {urn:nbn:de:0030-drops-50635},
doi = {10.4230/LIPIcs.CCC.2015.537},
annote = {Keywords: Quantum Algorithms, Query Complexity, Elitzur-Vaidman Bomb Tester, Adversary Method, Maximum Bipartite Matching}
}
@InProceedings{kane:LIPIcs.CCC.2015.567,
author = {Kane, Daniel M.},
title = {{A Polylogarithmic PRG for Degree 2 Threshold Functions in the Gaussian Setting}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {567--581},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.567},
URN = {urn:nbn:de:0030-drops-50534},
doi = {10.4230/LIPIcs.CCC.2015.567},
annote = {Keywords: polynomial threshold function, pseudorandom generator, Gaussian distribution}
}
@InProceedings{applebaum_et_al:LIPIcs.CCC.2015.582,
author = {Applebaum, Benny and Artemenko, Sergei and Shaltiel, Ronen and Yang, Guang},
title = {{Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {582--600},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.582},
URN = {urn:nbn:de:0030-drops-50567},
doi = {10.4230/LIPIcs.CCC.2015.582},
annote = {Keywords: compression, pseudorandomness, extractors, nondeterministic reductions}
}
@InProceedings{goldreich_et_al:LIPIcs.CCC.2015.601,
author = {Goldreich, Oded and Viola, Emanuele and Wigderson, Avi},
title = {{On Randomness Extraction in AC0}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {601--668},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.601},
URN = {urn:nbn:de:0030-drops-50515},
doi = {10.4230/LIPIcs.CCC.2015.601},
annote = {Keywords: AC0, randomness extractors, general min-entropy sources, block sources, bit-fixing sources, multiple-source extraction}
}
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