Search dblp for Publications

export results for "toc:db/conf/coco/coco2019.bht:"

 download as .bib file

@inproceedings{DBLP:conf/coco/Alman19,
  author       = {Josh Alman},
  editor       = {Amir Shpilka},
  title        = {Limits on the Universal Method for Matrix Multiplication},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {12:1--12:24},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.12},
  doi          = {10.4230/LIPICS.CCC.2019.12},
  timestamp    = {Thu, 02 Feb 2023 13:27:04 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Alman19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/AtseriasH19,
  author       = {Albert Atserias and
                  Tuomas Hakoniemi},
  editor       = {Amir Shpilka},
  title        = {Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz
                  Proofs},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {24:1--24:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.24},
  doi          = {10.4230/LIPICS.CCC.2019.24},
  timestamp    = {Sun, 04 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/AtseriasH19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Bafna019,
  author       = {Mitali Bafna and
                  Nikhil Vyas},
  editor       = {Amir Shpilka},
  title        = {Imperfect Gaps in Gap-ETH and PCPs},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {32:1--32:19},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.32},
  doi          = {10.4230/LIPICS.CCC.2019.32},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Bafna019.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BhangaleK19,
  author       = {Amey Bhangale and
                  Subhash Khot},
  editor       = {Amir Shpilka},
  title        = {UG-Hardness to NP-Hardness by Losing Half},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {3:1--3:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.3},
  doi          = {10.4230/LIPICS.CCC.2019.3},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BhangaleK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BlaisB19,
  author       = {Eric Blais and
                  Joshua Brody},
  editor       = {Amir Shpilka},
  title        = {Optimal Separation and Strong Direct Sum for Randomized Query Complexity},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {29:1--29:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.29},
  doi          = {10.4230/LIPICS.CCC.2019.29},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BlaisB19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BravermanEGY19,
  author       = {Mark Braverman and
                  Klim Efremenko and
                  Ran Gelles and
                  Michael A. Yitayew},
  editor       = {Amir Shpilka},
  title        = {Optimal Short-Circuit Resilient Formulas},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {10:1--10:22},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.10},
  doi          = {10.4230/LIPICS.CCC.2019.10},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BravermanEGY19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BringmannFK19,
  author       = {Karl Bringmann and
                  Nick Fischer and
                  Marvin K{\"{u}}nnemann},
  editor       = {Amir Shpilka},
  title        = {A Fine-Grained Analogue of Schaefer's Theorem in {P:} Dichotomy of
                  Existsk-Forall-Quantified First-Order Graph Properties},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {31:1--31:27},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.31},
  doi          = {10.4230/LIPICS.CCC.2019.31},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BringmannFK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Bshouty19,
  author       = {Nader H. Bshouty},
  editor       = {Amir Shpilka},
  title        = {Almost Optimal Distribution-Free Junta Testing},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {2:1--2:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.2},
  doi          = {10.4230/LIPICS.CCC.2019.2},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Bshouty19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ChattopadhyayDS19,
  author       = {Eshan Chattopadhyay and
                  Anindya De and
                  Rocco A. Servedio},
  editor       = {Amir Shpilka},
  title        = {Simple and Efficient Pseudorandom Generators from Gaussian Processes},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {4:1--4:33},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.4},
  doi          = {10.4230/LIPICS.CCC.2019.4},
  timestamp    = {Sun, 04 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/ChattopadhyayDS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ChattopadhyayLV19,
  author       = {Arkadev Chattopadhyay and
                  Shachar Lovett and
                  Marc Vinyals},
  editor       = {Amir Shpilka},
  title        = {Equality Alone Does not Simulate Randomness},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {14:1--14:11},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.14},
  doi          = {10.4230/LIPICS.CCC.2019.14},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ChattopadhyayLV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ChenMMW19,
  author       = {Lijie Chen and
                  Dylan M. McKay and
                  Cody D. Murray and
                  R. Ryan Williams},
  editor       = {Amir Shpilka},
  title        = {Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton
                  Theorems},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {30:1--30:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.30},
  doi          = {10.4230/LIPICS.CCC.2019.30},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ChenMMW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ChenW19,
  author       = {Lijie Chen and
                  R. Ryan Williams},
  editor       = {Amir Shpilka},
  title        = {Stronger Connections Between Circuit Analysis and Circuit Lower Bounds,
                  via PCPs of Proximity},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {19:1--19:43},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.19},
  doi          = {10.4230/LIPICS.CCC.2019.19},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ChenW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ChristandlVZ19,
  author       = {Matthias Christandl and
                  P{\'{e}}ter Vrana and
                  Jeroen Zuiddam},
  editor       = {Amir Shpilka},
  title        = {Barriers for Fast Matrix Multiplication from Irreversibility},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {26:1--26:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.26},
  doi          = {10.4230/LIPICS.CCC.2019.26},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ChristandlVZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/CoudronH19,
  author       = {Matthew Coudron and
                  Aram W. Harrow},
  editor       = {Amir Shpilka},
  title        = {Universality of {EPR} Pairs in Entanglement-Assisted Communication
                  Complexity, and the Communication Cost of State Conversion},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {20:1--20:25},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.20},
  doi          = {10.4230/LIPICS.CCC.2019.20},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/CoudronH19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/CoudronS19,
  author       = {Matthew Coudron and
                  William Slofstra},
  editor       = {Amir Shpilka},
  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, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {25:1--25:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.25},
  doi          = {10.4230/LIPICS.CCC.2019.25},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/CoudronS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/DantchevGM19,
  author       = {Stefan S. Dantchev and
                  Nicola Galesi and
                  Barnaby Martin},
  editor       = {Amir Shpilka},
  title        = {Resolution and the Binary Encoding of Combinatorial Principles},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {6:1--6:25},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.6},
  doi          = {10.4230/LIPICS.CCC.2019.6},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/DantchevGM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/DoronHH19,
  author       = {Dean Doron and
                  Pooya Hatami and
                  William M. Hoza},
  editor       = {Amir Shpilka},
  title        = {Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once
                  Formulas},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {16:1--16:34},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.16},
  doi          = {10.4230/LIPICS.CCC.2019.16},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/DoronHH19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/DvirL19,
  author       = {Zeev Dvir and
                  Allen Liu},
  editor       = {Amir Shpilka},
  title        = {Fourier and Circulant Matrices Are Not Rigid},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {17:1--17:23},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.17},
  doi          = {10.4230/LIPICS.CCC.2019.17},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/DvirL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/DwivediM019,
  author       = {Ashish Dwivedi and
                  Rajat Mittal and
                  Nitin Saxena},
  editor       = {Amir Shpilka},
  title        = {Counting Basic-Irreducible Factors Mod pk in Deterministic Poly-Time
                  and p-Adic Applications},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {15:1--15:29},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.15},
  doi          = {10.4230/LIPICS.CCC.2019.15},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/DwivediM019.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Gall19,
  author       = {Fran{\c{c}}ois Le Gall},
  editor       = {Amir Shpilka},
  title        = {Average-Case Quantum Advantage with Shallow Circuits},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {21:1--21:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.21},
  doi          = {10.4230/LIPICS.CCC.2019.21},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Gall19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/GargRT19,
  author       = {Sumegha Garg and
                  Ran Raz and
                  Avishay Tal},
  editor       = {Amir Shpilka},
  title        = {Time-Space Lower Bounds for Two-Pass Learning},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {22:1--22:39},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.22},
  doi          = {10.4230/LIPICS.CCC.2019.22},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/GargRT19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/HosseiniLY19,
  author       = {Kaave Hosseini and
                  Shachar Lovett and
                  Grigory Yaroslavtsev},
  editor       = {Amir Shpilka},
  title        = {Optimality of Linear Sketching Under Modular Updates},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {13:1--13:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.13},
  doi          = {10.4230/LIPICS.CCC.2019.13},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/HosseiniLY19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Hoza19,
  author       = {William M. Hoza},
  editor       = {Amir Shpilka},
  title        = {Typically-Correct Derandomization for Small Time and Space},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {9:1--9:39},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.9},
  doi          = {10.4230/LIPICS.CCC.2019.9},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Hoza19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Lee19,
  author       = {Chin Ho Lee},
  editor       = {Amir Shpilka},
  title        = {Fourier Bounds and Pseudorandom Generators for Product Tests},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {7:1--7:25},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.7},
  doi          = {10.4230/LIPICS.CCC.2019.7},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Lee19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Li19,
  author       = {Xin Li},
  editor       = {Amir Shpilka},
  title        = {Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal
                  Constructions},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {28:1--28:49},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.28},
  doi          = {10.4230/LIPICS.CCC.2019.28},
  timestamp    = {Wed, 19 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/Li19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/LovettSZ19,
  author       = {Shachar Lovett and
                  Noam Solomon and
                  Jiapeng Zhang},
  editor       = {Amir Shpilka},
  title        = {From {DNF} Compression to Sunflower Theorems via Regularity},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {5:1--5:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.5},
  doi          = {10.4230/LIPICS.CCC.2019.5},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LovettSZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ODonnellS19,
  author       = {Ryan O'Donnell and
                  Tselil Schramm},
  editor       = {Amir Shpilka},
  title        = {Sherali - Adams Strikes Back},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {8:1--8:30},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.8},
  doi          = {10.4230/LIPICS.CCC.2019.8},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ODonnellS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/OliveiraPS19,
  author       = {Igor Carboni Oliveira and
                  J{\'{a}}n Pich and
                  Rahul Santhanam},
  editor       = {Amir Shpilka},
  title        = {Hardness Magnification near State-Of-The-Art Lower Bounds},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {27:1--27:29},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.27},
  doi          = {10.4230/LIPICS.CCC.2019.27},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/OliveiraPS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/OliveiraS019,
  author       = {Igor Carboni Oliveira and
                  Rahul Santhanam and
                  Srikanth Srinivasan},
  editor       = {Amir Shpilka},
  title        = {Parity Helps to Compute Majority},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {23:1--23:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.23},
  doi          = {10.4230/LIPICS.CCC.2019.23},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/OliveiraS019.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/RezendeNMR19,
  author       = {Susanna F. de Rezende and
                  Jakob Nordstr{\"{o}}m and
                  Or Meir and
                  Robert Robere},
  editor       = {Amir Shpilka},
  title        = {Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {18:1--18:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.18},
  doi          = {10.4230/LIPICS.CCC.2019.18},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/RezendeNMR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Rossman19,
  author       = {Benjamin Rossman},
  editor       = {Amir Shpilka},
  title        = {Criticality of Regular Formulas},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {1:1--1:28},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.1},
  doi          = {10.4230/LIPICS.CCC.2019.1},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Rossman19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Stephens-Davidowitz19,
  author       = {Noah Stephens{-}Davidowitz},
  editor       = {Amir Shpilka},
  title        = {A Time-Distance Trade-Off for {GDD} with Preprocessing - Instantiating
                  the {DLW} Heuristic},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {11:1--11:8},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.11},
  doi          = {10.4230/LIPICS.CCC.2019.11},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Stephens-Davidowitz19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/X19,
  editor       = {Amir Shpilka},
  title        = {Front Matter, Table of Contents, Preface, Conference Organization},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {0:1--0:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.0},
  doi          = {10.4230/LIPICS.CCC.2019.0},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/X19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/coco/2019,
  editor       = {Amir Shpilka},
  title        = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {http://www.dagstuhl.de/dagpub/978-3-95977-116-0},
  isbn         = {978-3-95977-116-0},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/2019.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.