Search dblp for Publications

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

 download as .bib file

@inproceedings{DBLP:conf/coco/AaronsonC17,
  author       = {Scott Aaronson and
                  Lijie Chen},
  editor       = {Ryan O'Donnell},
  title        = {Complexity-Theoretic Foundations of Quantum Supremacy Experiments},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {22:1--22:67},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.22},
  doi          = {10.4230/LIPICS.CCC.2017.22},
  timestamp    = {Thu, 02 Feb 2023 13:27:05 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/AaronsonC17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/AnshuBGJKL17,
  author       = {Anurag Anshu and
                  Shalev Ben{-}David and
                  Ankit Garg and
                  Rahul Jain and
                  Robin Kothari and
                  Troy Lee},
  editor       = {Ryan O'Donnell},
  title        = {Separating Quantum Communication and Approximate Rank},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {24:1--24:33},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.24},
  doi          = {10.4230/LIPICS.CCC.2017.24},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/AnshuBGJKL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ArunachalamW17,
  author       = {Srinivasan Arunachalam and
                  Ronald de Wolf},
  editor       = {Ryan O'Donnell},
  title        = {Optimal Quantum Sample Complexity of Learning Algorithms},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {25:1--25:31},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.25},
  doi          = {10.4230/LIPICS.CCC.2017.25},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ArunachalamW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BelovsIQSY17,
  author       = {Aleksandrs Belovs and
                  G{\'{a}}bor Ivanyos and
                  Youming Qiao and
                  Miklos Santha and
                  Siyi Yang},
  editor       = {Ryan O'Donnell},
  title        = {On the Polynomial Parity Argument Complexity of the Combinatorial
                  Nullstellensatz},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {30:1--30:24},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.30},
  doi          = {10.4230/LIPICS.CCC.2017.30},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BelovsIQSY17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BlaisCG17,
  author       = {Eric Blais and
                  Cl{\'{e}}ment L. Canonne and
                  Tom Gur},
  editor       = {Ryan O'Donnell},
  title        = {Distribution Testing Lower Bounds via Reductions from Communication
                  Complexity},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {28:1--28:40},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.28},
  doi          = {10.4230/LIPICS.CCC.2017.28},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BlaisCG17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BlaserJP17,
  author       = {Markus Bl{\"{a}}ser and
                  Gorav Jindal and
                  Anurag Pandey},
  editor       = {Ryan O'Donnell},
  title        = {Greedy Strikes Again: {A} Deterministic {PTAS} for Commutative Rank
                  of Matrix Spaces},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {33:1--33:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.33},
  doi          = {10.4230/LIPICS.CCC.2017.33},
  timestamp    = {Sun, 06 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/BlaserJP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BringmannIZ17,
  author       = {Karl Bringmann and
                  Christian Ikenmeyer and
                  Jeroen Zuiddam},
  editor       = {Ryan O'Donnell},
  title        = {On Algebraic Branching Programs of Small Width},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {20:1--20:31},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.20},
  doi          = {10.4230/LIPICS.CCC.2017.20},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BringmannIZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/CanonneG17,
  author       = {Cl{\'{e}}ment L. Canonne and
                  Tom Gur},
  editor       = {Ryan O'Donnell},
  title        = {An Adaptivity Hierarchy Theorem for Property Testing},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {27:1--27:25},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.27},
  doi          = {10.4230/LIPICS.CCC.2017.27},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/CanonneG17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ChenSTWX17,
  author       = {Xi Chen and
                  Rocco A. Servedio and
                  Li{-}Yang Tan and
                  Erik Waingarten and
                  Jinyu Xie},
  editor       = {Ryan O'Donnell},
  title        = {Settling the Query Complexity of Non-Adaptive Junta Testing},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {26:1--26:19},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.26},
  doi          = {10.4230/LIPICS.CCC.2017.26},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ChenSTWX17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/DaganFHL17,
  author       = {Yuval Dagan and
                  Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li},
  editor       = {Ryan O'Donnell},
  title        = {Trading Information Complexity for Error},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {16:1--16:59},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.16},
  doi          = {10.4230/LIPICS.CCC.2017.16},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/DaganFHL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/DeMN17,
  author       = {Anindya De and
                  Elchanan Mossel and
                  Joe Neeman},
  editor       = {Ryan O'Donnell},
  title        = {Noise Stability Is Computable and Approximately Low-Dimensional},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {10:1--10:11},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.10},
  doi          = {10.4230/LIPICS.CCC.2017.10},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/DeMN17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/DinurN17,
  author       = {Irit Dinur and
                  Inbal Livni Navon},
  editor       = {Ryan O'Donnell},
  title        = {Exponentially Small Soundness for the Direct Product Z-Test},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {29:1--29:50},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.29},
  doi          = {10.4230/LIPICS.CCC.2017.29},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/DinurN17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/GhoshT17,
  author       = {Mrinalkanti Ghosh and
                  Madhur Tulsiani},
  editor       = {Ryan O'Donnell},
  title        = {From Weak to Strong {LP} Gaps for All CSPs},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {11:1--11:27},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.11},
  doi          = {10.4230/LIPICS.CCC.2017.11},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/GhoshT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/GoosKPW17,
  author       = {Mika G{\"{o}}{\"{o}}s and
                  Pritish Kamath and
                  Toniann Pitassi and
                  Thomas Watson},
  editor       = {Ryan O'Donnell},
  title        = {Query-to-Communication Lifting for {PNP}},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {12:1--12:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.12},
  doi          = {10.4230/LIPICS.CCC.2017.12},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/GoosKPW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/HaramatyLV17,
  author       = {Elad Haramaty and
                  Chin Ho Lee and
                  Emanuele Viola},
  editor       = {Ryan O'Donnell},
  title        = {Bounded Independence Plus Noise Fools Products},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {14:1--14:30},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.14},
  doi          = {10.4230/LIPICS.CCC.2017.14},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/HaramatyLV17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/HiraharaS17,
  author       = {Shuichi Hirahara and
                  Rahul Santhanam},
  editor       = {Ryan O'Donnell},
  title        = {On the Average-Case Complexity of {MCSP} and Its Variants},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {7:1--7:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.7},
  doi          = {10.4230/LIPICS.CCC.2017.7},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/HiraharaS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/KayalNST17,
  author       = {Neeraj Kayal and
                  Vineet Nair and
                  Chandan Saha and
                  S{\'{e}}bastien Tavenas},
  editor       = {Ryan O'Donnell},
  title        = {Reconstruction of Full Rank Algebraic Branching Programs},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {21:1--21:61},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.21},
  doi          = {10.4230/LIPICS.CCC.2017.21},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/KayalNST17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Kumar17,
  author       = {Mrinal Kumar},
  editor       = {Ryan O'Donnell},
  title        = {A Quadratic Lower Bound for Homogeneous Algebraic Branching Programs},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {19:1--19:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.19},
  doi          = {10.4230/LIPICS.CCC.2017.19},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Kumar17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/KumarS17,
  author       = {Mrinal Kumar and
                  Ramprasad Saptharishi},
  editor       = {Ryan O'Donnell},
  title        = {An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite
                  Fields},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {31:1--31:30},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.31},
  doi          = {10.4230/LIPICS.CCC.2017.31},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/KumarS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/LauriaN17,
  author       = {Massimo Lauria and
                  Jakob Nordstr{\"{o}}m},
  editor       = {Ryan O'Donnell},
  title        = {Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz
                  and Gr{\"{o}}bner Bases},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {2:1--2:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.2},
  doi          = {10.4230/LIPICS.CCC.2017.2},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LauriaN17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/MelkebeekP17,
  author       = {Dieter van Melkebeek and
                  Gautam Prakriya},
  editor       = {Ryan O'Donnell},
  title        = {Derandomizing Isolation in Space-Bounded Settings},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {5:1--5:32},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.5},
  doi          = {10.4230/LIPICS.CCC.2017.5},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/MelkebeekP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/MilovanovV17,
  author       = {Alexey Milovanov and
                  Nikolay K. Vereshchagin},
  editor       = {Ryan O'Donnell},
  title        = {Stochasticity in Algorithmic Statistics for Polynomial Time},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {17:1--17:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.17},
  doi          = {10.4230/LIPICS.CCC.2017.17},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/MilovanovV17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/MinahanV17,
  author       = {Daniel Minahan and
                  Ilya Volkovich},
  editor       = {Ryan O'Donnell},
  title        = {Complete Derandomization of Identity Testing and Reconstruction of
                  Read-Once Formulas},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {32:1--32:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.32},
  doi          = {10.4230/LIPICS.CCC.2017.32},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/MinahanV17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/MurrayW17,
  author       = {Cody D. Murray and
                  R. Ryan Williams},
  editor       = {Ryan O'Donnell},
  title        = {Easiness Amplification and Uniform Circuit Lower Bounds},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {8:1--8:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.8},
  doi          = {10.4230/LIPICS.CCC.2017.8},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/MurrayW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/NayakT17,
  author       = {Ashwin Nayak and
                  Dave Touchette},
  editor       = {Ryan O'Donnell},
  title        = {Augmented Index and Quantum Streaming Algorithms for {DYCK(2)}},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {23:1--23:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.23},
  doi          = {10.4230/LIPICS.CCC.2017.23},
  timestamp    = {Mon, 18 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/NayakT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/NguyenP17,
  author       = {Danny Nguyen and
                  Igor Pak},
  editor       = {Ryan O'Donnell},
  title        = {The Computational Complexity of Integer Programming with Alternations},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {6:1--6:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.6},
  doi          = {10.4230/LIPICS.CCC.2017.6},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/NguyenP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/OliveiraP17,
  author       = {Mateus de Oliveira Oliveira and
                  Pavel Pudl{\'{a}}k},
  editor       = {Ryan O'Donnell},
  title        = {Representations of Monotone Boolean Functions by Linear Programs},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {3:1--3:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.3},
  doi          = {10.4230/LIPICS.CCC.2017.3},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/OliveiraP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/OliveiraS17,
  author       = {Igor C. Oliveira and
                  Rahul Santhanam},
  editor       = {Ryan O'Donnell},
  title        = {Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and
                  Pseudorandomness},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {18:1--18:49},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.18},
  doi          = {10.4230/LIPICS.CCC.2017.18},
  timestamp    = {Tue, 30 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/OliveiraS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/PotechinP17,
  author       = {Aaron Potechin},
  editor       = {Ryan O'Donnell},
  title        = {A Note on Amortized Branching Program Complexity},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {4:1--4:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.4},
  doi          = {10.4230/LIPICS.CCC.2017.4},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/PotechinP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/PudlakT17,
  author       = {Pavel Pudl{\'{a}}k and
                  Neil Thapen},
  editor       = {Ryan O'Donnell},
  title        = {Random Resolution Refutations},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {1:1--1:10},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.1},
  doi          = {10.4230/LIPICS.CCC.2017.1},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/PudlakT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/SchederS17,
  author       = {Dominik Scheder and
                  John P. Steinberger},
  editor       = {Ryan O'Donnell},
  title        = {{PPSZ} for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT
                  Faster},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {9:1--9:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.9},
  doi          = {10.4230/LIPICS.CCC.2017.9},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/SchederS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Tal17,
  author       = {Avishay Tal},
  editor       = {Ryan O'Donnell},
  title        = {Tight Bounds on the Fourier Spectrum of {AC0}},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {15:1--15:31},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.15},
  doi          = {10.4230/LIPICS.CCC.2017.15},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Tal17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Tell17,
  author       = {Roei Tell},
  editor       = {Ryan O'Donnell},
  title        = {Improved Bounds for Quantified Derandomization of Constant-Depth Circuits
                  and Polynomials},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {13:1--13:48},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.13},
  doi          = {10.4230/LIPICS.CCC.2017.13},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Tell17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/X17,
  editor       = {Ryan O'Donnell},
  title        = {Front Matter, Table of Contents, Preface, Awards, Conference Organization,
                  External Reviewers},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {0:i--0:xiv},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.0},
  doi          = {10.4230/LIPICS.CCC.2017.0},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/X17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/coco/2017,
  editor       = {Ryan O'Donnell},
  title        = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {http://www.dagstuhl.de/dagpub/978-3-95977-040-8},
  isbn         = {978-3-95977-040-8},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/2017.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.