@Proceedings{servedio:LIPIcs.CCC.2018,
title = {{LIPIcs, Volume 102, CCC'18, Complete Volume}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018},
URN = {urn:nbn:de:0030-drops-89338},
doi = {10.4230/LIPIcs.CCC.2018},
annote = {Keywords: Theory of computation}
}
@InProceedings{servedio:LIPIcs.CCC.2018.0,
author = {Servedio, Rocco A.},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {0:i--0:xi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.0},
URN = {urn:nbn:de:0030-drops-88609},
doi = {10.4230/LIPIcs.CCC.2018.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.CCC.2018.1,
author = {Chattopadhyay, Eshan and Hatami, Pooya and Hosseini, Kaave and Lovett, Shachar},
title = {{Pseudorandom Generators from Polarizing Random Walks}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {1:1--1:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.1},
URN = {urn:nbn:de:0030-drops-88880},
doi = {10.4230/LIPIcs.CCC.2018.1},
annote = {Keywords: AC0, branching program, polarization, pseudorandom generators, random walks, Sensitivity}
}
@InProceedings{kane_et_al:LIPIcs.CCC.2018.2,
author = {Kane, Daniel and Rao, Sankeerth},
title = {{A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {2:1--2:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.2},
URN = {urn:nbn:de:0030-drops-88861},
doi = {10.4230/LIPIcs.CCC.2018.2},
annote = {Keywords: Pseudorandomness, Polynomial Threshold Functions}
}
@InProceedings{benaroya_et_al:LIPIcs.CCC.2018.3,
author = {Ben-Aroya, Avraham and Chattopadhyay, Eshan and Doron, Dean and Li, Xin and Ta-Shma, Amnon},
title = {{A New Approach for Constructing Low-Error, Two-Source Extractors}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {3:1--3:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.3},
URN = {urn:nbn:de:0030-drops-88877},
doi = {10.4230/LIPIcs.CCC.2018.3},
annote = {Keywords: Two-Source Extractors, Non-Malleable Extractors, Pseudorandomness, Explicit Constructions}
}
@InProceedings{guruswami_et_al:LIPIcs.CCC.2018.4,
author = {Guruswami, Venkatesan and Resch, Nicolas and Xing, Chaoping},
title = {{Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {4:1--4:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.4},
URN = {urn:nbn:de:0030-drops-88859},
doi = {10.4230/LIPIcs.CCC.2018.4},
annote = {Keywords: Algebraic constructions, coding theory, linear algebra, list-decoding, polynomial method, pseudorandomness}
}
@InProceedings{hirahara_et_al:LIPIcs.CCC.2018.5,
author = {Hirahara, Shuichi and Oliveira, Igor C. and Santhanam, Rahul},
title = {{NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {5:1--5:31},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.5},
URN = {urn:nbn:de:0030-drops-88831},
doi = {10.4230/LIPIcs.CCC.2018.5},
annote = {Keywords: NP-hardness, Minimum Circuit Size Problem, depth-3 circuits}
}
@InProceedings{williams:LIPIcs.CCC.2018.6,
author = {Williams, Richard Ryan},
title = {{Limits on Representing Boolean Functions by Linear Combinations of Simple Functions: Thresholds, ReLUs, and Low-Degree Polynomials}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {6:1--6:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.6},
URN = {urn:nbn:de:0030-drops-88846},
doi = {10.4230/LIPIcs.CCC.2018.6},
annote = {Keywords: linear threshold functions, lower bounds, neural networks, low-degree polynomials}
}
@InProceedings{impagliazzo_et_al:LIPIcs.CCC.2018.7,
author = {Impagliazzo, Russell and Kabanets, Valentine and Volkovich, Ilya},
title = {{The Power of Natural Properties as Oracles}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {7:1--7:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.7},
URN = {urn:nbn:de:0030-drops-88824},
doi = {10.4230/LIPIcs.CCC.2018.7},
annote = {Keywords: natural properties, Minimal Circuit Size Problem (MCSP), circuit lower bounds, hardness of MCSP, learning algorithms, obfuscation, Indistinguishability Obfuscators (IO)}
}
@InProceedings{kannan_et_al:LIPIcs.CCC.2018.8,
author = {Kannan, Sampath and Mossel, Elchanan and Sanyal, Swagato and Yaroslavtsev, Grigory},
title = {{Linear Sketching over F\underline2}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {8:1--8:37},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.8},
URN = {urn:nbn:de:0030-drops-88819},
doi = {10.4230/LIPIcs.CCC.2018.8},
annote = {Keywords: Linear sketch, Streaming algorithms, XOR-functions, Communication complexity}
}
@InProceedings{watson:LIPIcs.CCC.2018.9,
author = {Watson, Thomas},
title = {{Communication Complexity with Small Advantage}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.9},
URN = {urn:nbn:de:0030-drops-88805},
doi = {10.4230/LIPIcs.CCC.2018.9},
annote = {Keywords: Communication, complexity, small, advantage}
}
@InProceedings{guo_et_al:LIPIcs.CCC.2018.10,
author = {Guo, Zeyu and Saxena, Nitin and Sinhababu, Amit},
title = {{Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {10:1--10:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.10},
URN = {urn:nbn:de:0030-drops-88786},
doi = {10.4230/LIPIcs.CCC.2018.10},
annote = {Keywords: algebraic dependence, Jacobian, Arthur-Merlin, approximate polynomial, satisfiability, hitting-set, border VP, finite field, PSPACE, EXPSPACE, GCT Chasm}
}
@InProceedings{alon_et_al:LIPIcs.CCC.2018.11,
author = {Alon, Noga and Kumar, Mrinal and Volk, Ben Lee},
title = {{Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {11:1--11:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.11},
URN = {urn:nbn:de:0030-drops-88799},
doi = {10.4230/LIPIcs.CCC.2018.11},
annote = {Keywords: Algebraic Complexity, Multilinear Circuits, Circuit Lower Bounds}
}
@InProceedings{carmosino_et_al:LIPIcs.CCC.2018.12,
author = {Carmosino, Marco L. and Impagliazzo, Russell and Lovett, Shachar and Mihajlin, Ivan},
title = {{Hardness Amplification for Non-Commutative Arithmetic Circuits}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {12:1--12:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.12},
URN = {urn:nbn:de:0030-drops-88772},
doi = {10.4230/LIPIcs.CCC.2018.12},
annote = {Keywords: arithmetic circuits, hardness amplification, circuit lower bounds, non-commutative computation}
}
@InProceedings{chou_et_al:LIPIcs.CCC.2018.13,
author = {Chou, Chi-Ning and Kumar, Mrinal and Solomon, Noam},
title = {{Hardness vs Randomness for Bounded Depth Arithmetic Circuits}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {13:1--13:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.13},
URN = {urn:nbn:de:0030-drops-88765},
doi = {10.4230/LIPIcs.CCC.2018.13},
annote = {Keywords: Algebraic Complexity, Polynomial Factorization Circuit Lower Bounds, Polynomial Identity Testing}
}
@InProceedings{chen:LIPIcs.CCC.2018.14,
author = {Chen, Lijie},
title = {{On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {14:1--14:45},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.14},
URN = {urn:nbn:de:0030-drops-88752},
doi = {10.4230/LIPIcs.CCC.2018.14},
annote = {Keywords: Maximum Inner Product, SETH, Hardness of Approximation in P, Fined-Grained Complexity, Hopcroft's Problem, Chinese Remainder Theorem}
}
@InProceedings{edmonds_et_al:LIPIcs.CCC.2018.15,
author = {Edmonds, Jeff and Medabalimi, Venkatesh and Pitassi, Toniann},
title = {{Hardness of Function Composition for Semantic Read once Branching Programs}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {15:1--15:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.15},
URN = {urn:nbn:de:0030-drops-88747},
doi = {10.4230/LIPIcs.CCC.2018.15},
annote = {Keywords: Branching Programs, Function Composition, Time-Space Tradeoffs, Semantic Read Once, Tree Evaluation Problem}
}
@InProceedings{buss_et_al:LIPIcs.CCC.2018.16,
author = {Buss, Sam and Itsykson, Dmitry and Knop, Alexander and Sokolov, Dmitry},
title = {{Reordering Rule Makes OBDD Proof Systems Stronger}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {16:1--16:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.16},
URN = {urn:nbn:de:0030-drops-88720},
doi = {10.4230/LIPIcs.CCC.2018.16},
annote = {Keywords: Proof complexity, OBDD, Tseitin formulas, the Clique-Coloring principle, lifting theorems}
}
@InProceedings{chiesa_et_al:LIPIcs.CCC.2018.17,
author = {Chiesa, Alessandro and Manohar, Peter and Shinkar, Igor},
title = {{Testing Linearity against Non-Signaling Strategies}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {17:1--17:37},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.17},
URN = {urn:nbn:de:0030-drops-88731},
doi = {10.4230/LIPIcs.CCC.2018.17},
annote = {Keywords: property testing, linearity testing, non-signaling strategies, quasi-distributions}
}
@InProceedings{beneliezer_et_al:LIPIcs.CCC.2018.18,
author = {Ben-Eliezer, Omri and Fischer, Eldar},
title = {{Earthmover Resilience and Testing in Ordered Structures}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {18:1--18:35},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.18},
URN = {urn:nbn:de:0030-drops-88718},
doi = {10.4230/LIPIcs.CCC.2018.18},
annote = {Keywords: characterizations of testability, distance estimation, earthmover resilient, ordered structures, property testing}
}
@InProceedings{grier_et_al:LIPIcs.CCC.2018.19,
author = {Grier, Daniel and Schaeffer, Luke},
title = {{New Hardness Results for the Permanent Using Linear Optics}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {19:1--19:29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.19},
URN = {urn:nbn:de:0030-drops-88702},
doi = {10.4230/LIPIcs.CCC.2018.19},
annote = {Keywords: Permanent, Linear optics, #P-hardness, Orthogonal matrices}
}
@InProceedings{natarajan_et_al:LIPIcs.CCC.2018.20,
author = {Natarajan, Anand and Vidick, Thomas},
title = {{Retracted: Two-Player Entangled Games are NP-Hard}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {20:1--20:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.20},
URN = {urn:nbn:de:0030-drops-88696},
doi = {10.4230/LIPIcs.CCC.2018.20},
annote = {Keywords: low-degree testing, entangled nonlocal games, multi-prover interactive proof systems}
}
@InProceedings{bouland_et_al:LIPIcs.CCC.2018.21,
author = {Bouland, Adam and Fitzsimons, Joseph F. and Koh, Dax Enshan},
title = {{Complexity Classification of Conjugated Clifford Circuits}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {21:1--21:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.21},
URN = {urn:nbn:de:0030-drops-88677},
doi = {10.4230/LIPIcs.CCC.2018.21},
annote = {Keywords: gate set classification, quantum advantage, sampling problems, polynomial hierarchy}
}
@InProceedings{reingold_et_al:LIPIcs.CCC.2018.22,
author = {Reingold, Omer and Rothblum, Guy N. and Rothblum, Ron D.},
title = {{Efficient Batch Verification for UP}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {22:1--22:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.22},
URN = {urn:nbn:de:0030-drops-88681},
doi = {10.4230/LIPIcs.CCC.2018.22},
annote = {Keywords: Interactive Proof, Batch Verification, Unique Solution}
}
@InProceedings{chen_et_al:LIPIcs.CCC.2018.23,
author = {Chen, Yi-Hsiu and G\"{o}\"{o}s, Mika and Vadhan, Salil P. and Zhang, Jiapeng},
title = {{A Tight Lower Bound for Entropy Flattening}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {23:1--23:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.23},
URN = {urn:nbn:de:0030-drops-88669},
doi = {10.4230/LIPIcs.CCC.2018.23},
annote = {Keywords: Entropy, One-way function}
}
@InProceedings{bensasson_et_al:LIPIcs.CCC.2018.24,
author = {Ben-Sasson, Eli and Kopparty, Swastik and Saraf, Shubhangi},
title = {{Worst-Case to Average Case Reductions for the Distance to a Code}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {24:1--24:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.24},
URN = {urn:nbn:de:0030-drops-88654},
doi = {10.4230/LIPIcs.CCC.2018.24},
annote = {Keywords: Proximity testing, Reed-Solomon codes, algebraic coding complexity}
}
@InProceedings{fleischer:LIPIcs.CCC.2018.25,
author = {Fleischer, Lukas},
title = {{On the Complexity of the Cayley Semigroup Membership Problem}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {25:1--25:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.25},
URN = {urn:nbn:de:0030-drops-88649},
doi = {10.4230/LIPIcs.CCC.2018.25},
annote = {Keywords: subsemigroup, multiplication table, generators, completeness, quasi-polynomial-size circuits, FOLL}
}
@InProceedings{lingas:LIPIcs.CCC.2018.26,
author = {Lingas, Andrzej},
title = {{Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {26:1--26:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.26},
URN = {urn:nbn:de:0030-drops-88630},
doi = {10.4230/LIPIcs.CCC.2018.26},
annote = {Keywords: Boolean circuits, semi-disjoint bilinear form, Boolean vector convolution, Boolean matrix product}
}
@InProceedings{natarajanramamoorthy_et_al:LIPIcs.CCC.2018.27,
author = {Natarajan Ramamoorthy, Sivaramakrishnan and Rao, Anup},
title = {{Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {27:1--27:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.27},
URN = {urn:nbn:de:0030-drops-88625},
doi = {10.4230/LIPIcs.CCC.2018.27},
annote = {Keywords: Non-adaptive data structures, Sunflower lemma}
}
@InProceedings{ghazi_et_al:LIPIcs.CCC.2018.28,
author = {Ghazi, Badih and Kamath, Pritish and Raghavendra, Prasad},
title = {{Dimension Reduction for Polynomials over Gaussian Space and Applications}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {28:1--28:37},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.28},
URN = {urn:nbn:de:0030-drops-88616},
doi = {10.4230/LIPIcs.CCC.2018.28},
annote = {Keywords: Dimension reduction, Low-degree Polynomials, Noise Stability, Non-Interactive Simulation}
}
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