@Proceedings{shpilka:LIPIcs.CCC.2019,
title = {{LIPIcs, Volume 137, CCC'19, Complete Volume}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019},
URN = {urn:nbn:de:0030-drops-108988},
doi = {10.4230/LIPIcs.CCC.2019},
annote = {Keywords: Theory of computation}
}
@InProceedings{shpilka:LIPIcs.CCC.2019.0,
author = {Shpilka, Amir},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {0:i--0:xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.0},
URN = {urn:nbn:de:0030-drops-108221},
doi = {10.4230/LIPIcs.CCC.2019.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{rossman:LIPIcs.CCC.2019.1,
author = {Rossman, Benjamin},
title = {{Criticality of Regular Formulas}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {1:1--1:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.1},
URN = {urn:nbn:de:0030-drops-108230},
doi = {10.4230/LIPIcs.CCC.2019.1},
annote = {Keywords: AC^0 circuits, formulas, criticality}
}
@InProceedings{bshouty:LIPIcs.CCC.2019.2,
author = {Bshouty, Nader H.},
title = {{Almost Optimal Distribution-Free Junta Testing}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {2:1--2:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.2},
URN = {urn:nbn:de:0030-drops-108249},
doi = {10.4230/LIPIcs.CCC.2019.2},
annote = {Keywords: Distribution-free property testing, k-Junta}
}
@InProceedings{bhangale_et_al:LIPIcs.CCC.2019.3,
author = {Bhangale, Amey and Khot, Subhash},
title = {{UG-Hardness to NP-Hardness by Losing Half}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {3:1--3:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.3},
URN = {urn:nbn:de:0030-drops-108258},
doi = {10.4230/LIPIcs.CCC.2019.3},
annote = {Keywords: NP-hardness, Inapproximability, Unique Games Conjecture}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.CCC.2019.4,
author = {Chattopadhyay, Eshan and De, Anindya and Servedio, Rocco A.},
title = {{Simple and Efficient Pseudorandom Generators from Gaussian Processes}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {4:1--4:33},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.4},
URN = {urn:nbn:de:0030-drops-108262},
doi = {10.4230/LIPIcs.CCC.2019.4},
annote = {Keywords: Polynomial threshold functions, Gaussian processes, Johnson-Lindenstrauss, pseudorandom generators}
}
@InProceedings{lovett_et_al:LIPIcs.CCC.2019.5,
author = {Lovett, Shachar and Solomon, Noam and Zhang, Jiapeng},
title = {{From DNF Compression to Sunflower Theorems via Regularity}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {5:1--5:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.5},
URN = {urn:nbn:de:0030-drops-108277},
doi = {10.4230/LIPIcs.CCC.2019.5},
annote = {Keywords: DNF sparsification, sunflower conjecture, regular set systems}
}
@InProceedings{dantchev_et_al:LIPIcs.CCC.2019.6,
author = {Dantchev, Stefan and Galesi, Nicola and Martin, Barnaby},
title = {{Resolution and the Binary Encoding of Combinatorial Principles}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {6:1--6:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.6},
URN = {urn:nbn:de:0030-drops-108287},
doi = {10.4230/LIPIcs.CCC.2019.6},
annote = {Keywords: Proof complexity, k-DNF resolution, binary encodings, Clique and Pigeonhole principle}
}
@InProceedings{lee:LIPIcs.CCC.2019.7,
author = {Lee, Chin Ho},
title = {{Fourier Bounds and Pseudorandom Generators for Product Tests}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {7:1--7:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.7},
URN = {urn:nbn:de:0030-drops-108296},
doi = {10.4230/LIPIcs.CCC.2019.7},
annote = {Keywords: bounded independence plus noise, Fourier spectrum, product test, pseudorandom generators}
}
@InProceedings{odonnell_et_al:LIPIcs.CCC.2019.8,
author = {O'Donnell, Ryan and Schramm, Tselil},
title = {{Sherali - Adams Strikes Back}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {8:1--8:30},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.8},
URN = {urn:nbn:de:0030-drops-108309},
doi = {10.4230/LIPIcs.CCC.2019.8},
annote = {Keywords: Linear programming, Sherali, Adams, max-cut, graph eigenvalues, Sum-of-Squares}
}
@InProceedings{hoza:LIPIcs.CCC.2019.9,
author = {Hoza, William M.},
title = {{Typically-Correct Derandomization for Small Time and Space}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {9:1--9:39},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.9},
URN = {urn:nbn:de:0030-drops-108317},
doi = {10.4230/LIPIcs.CCC.2019.9},
annote = {Keywords: Derandomization, pseudorandomness, space complexity}
}
@InProceedings{braverman_et_al:LIPIcs.CCC.2019.10,
author = {Braverman, Mark and Efremenko, Klim and Gelles, Ran and Yitayew, Michael A.},
title = {{Optimal Short-Circuit Resilient Formulas}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {10:1--10:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.10},
URN = {urn:nbn:de:0030-drops-108326},
doi = {10.4230/LIPIcs.CCC.2019.10},
annote = {Keywords: Circuit Complexity, Noise-Resilient Circuits, Interactive Coding, Coding Theory, Karchmer-Wigderson Games}
}
@InProceedings{stephensdavidowitz:LIPIcs.CCC.2019.11,
author = {Stephens-Davidowitz, Noah},
title = {{A Time-Distance Trade-Off for GDD with Preprocessing - Instantiating the DLW Heuristic}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {11:1--11:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.11},
URN = {urn:nbn:de:0030-drops-108331},
doi = {10.4230/LIPIcs.CCC.2019.11},
annote = {Keywords: Lattices, guaranteed distance decoding, GDD, GDDP}
}
@InProceedings{alman:LIPIcs.CCC.2019.12,
author = {Alman, Josh},
title = {{Limits on the Universal Method for Matrix Multiplication}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {12:1--12:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.12},
URN = {urn:nbn:de:0030-drops-108347},
doi = {10.4230/LIPIcs.CCC.2019.12},
annote = {Keywords: Matrix Multiplication, Laser Method, Slice Rank}
}
@InProceedings{hosseini_et_al:LIPIcs.CCC.2019.13,
author = {Hosseini, Kaave and Lovett, Shachar and Yaroslavtsev, Grigory},
title = {{Optimality of Linear Sketching Under Modular Updates}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {13:1--13:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.13},
URN = {urn:nbn:de:0030-drops-108355},
doi = {10.4230/LIPIcs.CCC.2019.13},
annote = {Keywords: communication complexity, linear sketching, streaming algorithm}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.CCC.2019.14,
author = {Chattopadhyay, Arkadev and Lovett, Shachar and Vinyals, Marc},
title = {{Equality Alone Does not Simulate Randomness}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {14:1--14:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.14},
URN = {urn:nbn:de:0030-drops-108368},
doi = {10.4230/LIPIcs.CCC.2019.14},
annote = {Keywords: Communication lower bound, derandomization}
}
@InProceedings{dwivedi_et_al:LIPIcs.CCC.2019.15,
author = {Dwivedi, Ashish and Mittal, Rajat and Saxena, Nitin},
title = {{Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {15:1--15:29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.15},
URN = {urn:nbn:de:0030-drops-108373},
doi = {10.4230/LIPIcs.CCC.2019.15},
annote = {Keywords: deterministic, root, counting, modulo, prime-power, tree, basic irreducible, unramified}
}
@InProceedings{doron_et_al:LIPIcs.CCC.2019.16,
author = {Doron, Dean and Hatami, Pooya and Hoza, William M.},
title = {{Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {16:1--16:34},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.16},
URN = {urn:nbn:de:0030-drops-108382},
doi = {10.4230/LIPIcs.CCC.2019.16},
annote = {Keywords: Pseudorandom generators, Constant-depth formulas, Explicit constructions}
}
@InProceedings{dvir_et_al:LIPIcs.CCC.2019.17,
author = {Dvir, Zeev and Liu, Allen},
title = {{Fourier and Circulant Matrices Are Not Rigid}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {17:1--17:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.17},
URN = {urn:nbn:de:0030-drops-108390},
doi = {10.4230/LIPIcs.CCC.2019.17},
annote = {Keywords: Rigidity, Fourier matrix, Circulant matrix}
}
@InProceedings{derezende_et_al:LIPIcs.CCC.2019.18,
author = {de Rezende, Susanna F. and Nordstr\"{o}m, Jakob and Meir, Or and Robere, Robert},
title = {{Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {18:1--18:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.18},
URN = {urn:nbn:de:0030-drops-108403},
doi = {10.4230/LIPIcs.CCC.2019.18},
annote = {Keywords: proof complexity, Nullstellensatz, pebble games, trade-offs, size, degree}
}
@InProceedings{chen_et_al:LIPIcs.CCC.2019.19,
author = {Chen, Lijie and Williams, R. Ryan},
title = {{Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {19:1--19:43},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.19},
URN = {urn:nbn:de:0030-drops-108419},
doi = {10.4230/LIPIcs.CCC.2019.19},
annote = {Keywords: PCP of Proximity, Circuit Lower Bounds, Derandomization, Threshold Circuits, ReLU}
}
@InProceedings{coudron_et_al:LIPIcs.CCC.2019.20,
author = {Coudron, Matthew and Harrow, Aram W.},
title = {{Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {20:1--20:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.20},
URN = {urn:nbn:de:0030-drops-108421},
doi = {10.4230/LIPIcs.CCC.2019.20},
annote = {Keywords: Entanglement, quantum communication complexity}
}
@InProceedings{legall:LIPIcs.CCC.2019.21,
author = {Le Gall, Fran\c{c}ois},
title = {{Average-Case Quantum Advantage with Shallow Circuits}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {21:1--21:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.21},
URN = {urn:nbn:de:0030-drops-108432},
doi = {10.4230/LIPIcs.CCC.2019.21},
annote = {Keywords: Quantum computing, circuit complexity, constant-depth circuits}
}
@InProceedings{garg_et_al:LIPIcs.CCC.2019.22,
author = {Garg, Sumegha and Raz, Ran and Tal, Avishay},
title = {{Time-Space Lower Bounds for Two-Pass Learning}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {22:1--22:39},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.22},
URN = {urn:nbn:de:0030-drops-108446},
doi = {10.4230/LIPIcs.CCC.2019.22},
annote = {Keywords: branching program, time-space tradeoffs, two-pass streaming, PAC learning, lower bounds}
}
@InProceedings{oliveira_et_al:LIPIcs.CCC.2019.23,
author = {Oliveira, Igor Carboni and Santhanam, Rahul and Srinivasan, Srikanth},
title = {{Parity Helps to Compute Majority}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {23:1--23:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.23},
URN = {urn:nbn:de:0030-drops-108453},
doi = {10.4230/LIPIcs.CCC.2019.23},
annote = {Keywords: Computational Complexity, Boolean Circuits, Lower Bounds, Parity, Majority}
}
@InProceedings{atserias_et_al:LIPIcs.CCC.2019.24,
author = {Atserias, Albert and Hakoniemi, Tuomas},
title = {{Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {24:1--24:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.24},
URN = {urn:nbn:de:0030-drops-108464},
doi = {10.4230/LIPIcs.CCC.2019.24},
annote = {Keywords: Proof complexity, semialgebraic proof systems, Sums-of-Squares, Positivstellensatz, trade-offs, lower bounds, monomial size, degree}
}
@InProceedings{coudron_et_al:LIPIcs.CCC.2019.25,
author = {Coudron, Matthew and Slofstra, William},
title = {{Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {25:1--25:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.25},
URN = {urn:nbn:de:0030-drops-108478},
doi = {10.4230/LIPIcs.CCC.2019.25},
annote = {Keywords: Quantum complexity theory, Non-local game, Multi-prover interactive proof, Entanglement}
}
@InProceedings{christandl_et_al:LIPIcs.CCC.2019.26,
author = {Christandl, Matthias and Vrana, P\'{e}ter and Zuiddam, Jeroen},
title = {{Barriers for Fast Matrix Multiplication from Irreversibility}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {26:1--26:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.26},
URN = {urn:nbn:de:0030-drops-108487},
doi = {10.4230/LIPIcs.CCC.2019.26},
annote = {Keywords: Matrix multiplication exponent, barriers, laser method}
}
@InProceedings{oliveira_et_al:LIPIcs.CCC.2019.27,
author = {Oliveira, Igor Carboni and Pich, J\'{a}n and Santhanam, Rahul},
title = {{Hardness Magnification near State-Of-The-Art Lower Bounds}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {27:1--27:29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.27},
URN = {urn:nbn:de:0030-drops-108494},
doi = {10.4230/LIPIcs.CCC.2019.27},
annote = {Keywords: Circuit Complexity, Minimum Circuit Size Problem, Kolmogorov Complexity}
}
@InProceedings{li:LIPIcs.CCC.2019.28,
author = {Li, Xin},
title = {{Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {28:1--28:49},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.28},
URN = {urn:nbn:de:0030-drops-108507},
doi = {10.4230/LIPIcs.CCC.2019.28},
annote = {Keywords: extractor, non-malleable, privacy, codes}
}
@InProceedings{blais_et_al:LIPIcs.CCC.2019.29,
author = {Blais, Eric and Brody, Joshua},
title = {{Optimal Separation and Strong Direct Sum for Randomized Query Complexity}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {29:1--29:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.29},
URN = {urn:nbn:de:0030-drops-108511},
doi = {10.4230/LIPIcs.CCC.2019.29},
annote = {Keywords: Decision trees, query complexity, communication complexity}
}
@InProceedings{chen_et_al:LIPIcs.CCC.2019.30,
author = {Chen, Lijie and McKay, Dylan M. and Murray, Cody D. and Williams, R. Ryan},
title = {{Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {30:1--30:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.30},
URN = {urn:nbn:de:0030-drops-108525},
doi = {10.4230/LIPIcs.CCC.2019.30},
annote = {Keywords: Karp-Lipton Theorems, Circuit Lower Bounds, Derandomization, Hardness Magnification}
}
@InProceedings{bringmann_et_al:LIPIcs.CCC.2019.31,
author = {Bringmann, Karl and Fischer, Nick and K\"{u}nnemann, Marvin},
title = {{A Fine-Grained Analogue of Schaefer’s Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {31:1--31:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.31},
URN = {urn:nbn:de:0030-drops-108533},
doi = {10.4230/LIPIcs.CCC.2019.31},
annote = {Keywords: Fine-grained Complexity, Hardness in P, Hyperclique Conjecture, Constrained Triangle Detection}
}
@InProceedings{bafna_et_al:LIPIcs.CCC.2019.32,
author = {Bafna, Mitali and Vyas, Nikhil},
title = {{Imperfect Gaps in Gap-ETH and PCPs}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {32:1--32:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.32},
URN = {urn:nbn:de:0030-drops-108545},
doi = {10.4230/LIPIcs.CCC.2019.32},
annote = {Keywords: PCP, Gap-ETH, Hardness of Approximation}
}
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