Search dblp for Publications

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

 download as .bib file

@inproceedings{DBLP:conf/coco/AlonKV18,
  author       = {Noga Alon and
                  Mrinal Kumar and
                  Ben Lee Volk},
  editor       = {Rocco A. Servedio},
  title        = {Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically
                  Multilinear Arithmetic Circuits},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {11:1--11:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.11},
  doi          = {10.4230/LIPICS.CCC.2018.11},
  timestamp    = {Thu, 02 Feb 2023 13:27:04 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/AlonKV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Ben-AroyaCD0T18,
  author       = {Avraham Ben{-}Aroya and
                  Eshan Chattopadhyay and
                  Dean Doron and
                  Xin Li and
                  Amnon Ta{-}Shma},
  editor       = {Rocco A. Servedio},
  title        = {A New Approach for Constructing Low-Error, Two-Source Extractors},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {3:1--3:19},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.3},
  doi          = {10.4230/LIPICS.CCC.2018.3},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Ben-AroyaCD0T18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Ben-EliezerF18,
  author       = {Omri Ben{-}Eliezer and
                  Eldar Fischer},
  editor       = {Rocco A. Servedio},
  title        = {Earthmover Resilience and Testing in Ordered Structures},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {18:1--18:35},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.18},
  doi          = {10.4230/LIPICS.CCC.2018.18},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Ben-EliezerF18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Ben-SassonKS18,
  author       = {Eli Ben{-}Sasson and
                  Swastik Kopparty and
                  Shubhangi Saraf},
  editor       = {Rocco A. Servedio},
  title        = {Worst-Case to Average Case Reductions for the Distance to a Code},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {24:1--24:23},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.24},
  doi          = {10.4230/LIPICS.CCC.2018.24},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Ben-SassonKS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BoulandFK18,
  author       = {Adam Bouland and
                  Joseph F. Fitzsimons and
                  Dax Enshan Koh},
  editor       = {Rocco A. Servedio},
  title        = {Complexity Classification of Conjugated Clifford Circuits},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {21:1--21:25},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.21},
  doi          = {10.4230/LIPICS.CCC.2018.21},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BoulandFK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BussIKS18,
  author       = {Sam Buss and
                  Dmitry Itsykson and
                  Alexander Knop and
                  Dmitry Sokolov},
  editor       = {Rocco A. Servedio},
  title        = {Reordering Rule Makes {OBDD} Proof Systems Stronger},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {16:1--16:24},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.16},
  doi          = {10.4230/LIPICS.CCC.2018.16},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BussIKS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/CarmosinoILM18,
  author       = {Marco L. Carmosino and
                  Russell Impagliazzo and
                  Shachar Lovett and
                  Ivan Mihajlin},
  editor       = {Rocco A. Servedio},
  title        = {Hardness Amplification for Non-Commutative Arithmetic Circuits},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {12:1--12:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.12},
  doi          = {10.4230/LIPICS.CCC.2018.12},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/CarmosinoILM18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ChattopadhyayHH18,
  author       = {Eshan Chattopadhyay and
                  Pooya Hatami and
                  Kaave Hosseini and
                  Shachar Lovett},
  editor       = {Rocco A. Servedio},
  title        = {Pseudorandom Generators from Polarizing Random Walks},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {1:1--1:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.1},
  doi          = {10.4230/LIPICS.CCC.2018.1},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/ChattopadhyayHH18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Chen18,
  author       = {Lijie Chen},
  editor       = {Rocco A. Servedio},
  title        = {On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner
                  Product},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {14:1--14:45},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.14},
  doi          = {10.4230/LIPICS.CCC.2018.14},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Chen18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ChenGVZ18,
  author       = {Yi{-}Hsiu Chen and
                  Mika G{\"{o}}{\"{o}}s and
                  Salil P. Vadhan and
                  Jiapeng Zhang},
  editor       = {Rocco A. Servedio},
  title        = {A Tight Lower Bound for Entropy Flattening},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {23:1--23:28},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.23},
  doi          = {10.4230/LIPICS.CCC.2018.23},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ChenGVZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ChiesaMS18,
  author       = {Alessandro Chiesa and
                  Peter Manohar and
                  Igor Shinkar},
  editor       = {Rocco A. Servedio},
  title        = {Testing Linearity against Non-Signaling Strategies},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {17:1--17:37},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.17},
  doi          = {10.4230/LIPICS.CCC.2018.17},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ChiesaMS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ChouKS18,
  author       = {Chi{-}Ning Chou and
                  Mrinal Kumar and
                  Noam Solomon},
  editor       = {Rocco A. Servedio},
  title        = {Hardness vs Randomness for Bounded Depth Arithmetic Circuits},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {13:1--13:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.13},
  doi          = {10.4230/LIPICS.CCC.2018.13},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ChouKS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/EdmondsMP18,
  author       = {Jeff Edmonds and
                  Venkatesh Medabalimi and
                  Toniann Pitassi},
  editor       = {Rocco A. Servedio},
  title        = {Hardness of Function Composition for Semantic Read once Branching
                  Programs},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {15:1--15:22},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.15},
  doi          = {10.4230/LIPICS.CCC.2018.15},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/EdmondsMP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Fleischer18,
  author       = {Lukas Fleischer},
  editor       = {Rocco A. Servedio},
  title        = {On the Complexity of the Cayley Semigroup Membership Problem},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {25:1--25:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.25},
  doi          = {10.4230/LIPICS.CCC.2018.25},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Fleischer18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/GhaziKR18,
  author       = {Badih Ghazi and
                  Pritish Kamath and
                  Prasad Raghavendra},
  editor       = {Rocco A. Servedio},
  title        = {Dimension Reduction for Polynomials over Gaussian Space and Applications},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {28:1--28:37},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.28},
  doi          = {10.4230/LIPICS.CCC.2018.28},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/GhaziKR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/GrierS18,
  author       = {Daniel Grier and
                  Luke Schaeffer},
  editor       = {Rocco A. Servedio},
  title        = {New Hardness Results for the Permanent Using Linear Optics},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {19:1--19:29},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.19},
  doi          = {10.4230/LIPICS.CCC.2018.19},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/GrierS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Guo0S18,
  author       = {Zeyu Guo and
                  Nitin Saxena and
                  Amit Sinhababu},
  editor       = {Rocco A. Servedio},
  title        = {Algebraic Dependencies and {PSPACE} Algorithms in Approximative Complexity},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {10:1--10:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.10},
  doi          = {10.4230/LIPICS.CCC.2018.10},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/Guo0S18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/GuruswamiRX18,
  author       = {Venkatesan Guruswami and
                  Nicolas Resch and
                  Chaoping Xing},
  editor       = {Rocco A. Servedio},
  title        = {Lossless Dimension Expanders via Linearized Polynomials and Subspace
                  Designs},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {4:1--4:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.4},
  doi          = {10.4230/LIPICS.CCC.2018.4},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/GuruswamiRX18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/HiraharaOS18,
  author       = {Shuichi Hirahara and
                  Igor C. Oliveira and
                  Rahul Santhanam},
  editor       = {Rocco A. Servedio},
  title        = {NP-hardness of Minimum Circuit Size Problem for {OR-AND-MOD} Circuits},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {5:1--5:31},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.5},
  doi          = {10.4230/LIPICS.CCC.2018.5},
  timestamp    = {Tue, 30 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/HiraharaOS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ImpagliazzoKV18,
  author       = {Russell Impagliazzo and
                  Valentine Kabanets and
                  Ilya Volkovich},
  editor       = {Rocco A. Servedio},
  title        = {The Power of Natural Properties as Oracles},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {7:1--7:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.7},
  doi          = {10.4230/LIPICS.CCC.2018.7},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ImpagliazzoKV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/KaneR18,
  author       = {Daniel Kane and
                  Sankeerth Rao},
  editor       = {Rocco A. Servedio},
  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, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {2:1--2:24},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.2},
  doi          = {10.4230/LIPICS.CCC.2018.2},
  timestamp    = {Tue, 09 Apr 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/KaneR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/KannanMSY18,
  author       = {Sampath Kannan and
                  Elchanan Mossel and
                  Swagato Sanyal and
                  Grigory Yaroslavtsev},
  editor       = {Rocco A. Servedio},
  title        = {Linear Sketching over F{\_}2},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {8:1--8:37},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.8},
  doi          = {10.4230/LIPICS.CCC.2018.8},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/KannanMSY18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Lingas18,
  author       = {Andrzej Lingas},
  editor       = {Rocco A. Servedio},
  title        = {Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms
                  Require Logarithmic Conjunction-depth},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {26:1--26:10},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.26},
  doi          = {10.4230/LIPICS.CCC.2018.26},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Lingas18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/NatarajanV18,
  author       = {Anand Natarajan and
                  Thomas Vidick},
  editor       = {Rocco A. Servedio},
  title        = {Two-Player Entangled Games are NP-Hard},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {20:1--20:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.20},
  doi          = {10.4230/LIPICS.CCC.2018.20},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/NatarajanV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/RamamoorthyR18,
  author       = {Sivaramakrishnan Natarajan Ramamoorthy and
                  Anup Rao},
  editor       = {Rocco A. Servedio},
  title        = {Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers,
                  from Sunflowers},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {27:1--27:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.27},
  doi          = {10.4230/LIPICS.CCC.2018.27},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/RamamoorthyR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ReingoldRR18,
  author       = {Omer Reingold and
                  Guy N. Rothblum and
                  Ron D. Rothblum},
  editor       = {Rocco A. Servedio},
  title        = {Efficient Batch Verification for {UP}},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {22:1--22:23},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.22},
  doi          = {10.4230/LIPICS.CCC.2018.22},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ReingoldRR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Watson18,
  author       = {Thomas Watson},
  editor       = {Rocco A. Servedio},
  title        = {Communication Complexity with Small Advantage},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {9:1--9:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.9},
  doi          = {10.4230/LIPICS.CCC.2018.9},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Watson18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Williams18,
  author       = {Richard Ryan Williams},
  editor       = {Rocco A. Servedio},
  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, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {6:1--6:24},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.6},
  doi          = {10.4230/LIPICS.CCC.2018.6},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Williams18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/X18,
  editor       = {Rocco A. Servedio},
  title        = {Front Matter, Table of Contents, Preface, Conference Organization},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {0:i--0:xi},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.0},
  doi          = {10.4230/LIPICS.CCC.2018.0},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/X18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/coco/2018,
  editor       = {Rocco A. Servedio},
  title        = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {http://www.dagstuhl.de/dagpub/978-3-95977-069-9},
  isbn         = {978-3-95977-069-9},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/2018.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.