default search action
Search dblp for Publications
export results for "toc:db/conf/coco/coco2015.bht:"
@inproceedings{DBLP:conf/coco/0001L15, author = {Abhishek Bhowmick and Shachar Lovett}, editor = {David Zuckerman}, title = {Nonclassical Polynomials as a Barrier to Polynomial Lower Bounds}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {72--87}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.72}, doi = {10.4230/LIPICS.CCC.2015.72}, timestamp = {Thu, 02 Feb 2023 13:27:06 +0100}, biburl = {https://dblp.org/rec/conf/coco/0001L15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/ApplebaumASY15, author = {Benny Applebaum and Sergei Artemenko and Ronen Shaltiel and Guang Yang}, editor = {David Zuckerman}, title = {Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract)}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {582--600}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.582}, doi = {10.4230/LIPICS.CCC.2015.582}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/ApplebaumASY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/BeraC15, author = {Suman K. Bera and Amit Chakrabarti}, editor = {David Zuckerman}, title = {A Depth-Five Lower Bound for Iterated Matrix Multiplication}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {183--197}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.183}, doi = {10.4230/LIPICS.CCC.2015.183}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/BeraC15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/BhangaleHV15, author = {Amey Bhangale and Prahladh Harsha and Girish Varma}, editor = {David Zuckerman}, title = {A Characterization of Hard-to-cover CSPs}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {280--303}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.280}, doi = {10.4230/LIPICS.CCC.2015.280}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/BhangaleHV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/ChakrabartiCMTV15, author = {Amit Chakrabarti and Graham Cormode and Andrew McGregor and Justin Thaler and Suresh Venkatasubramanian}, editor = {David Zuckerman}, title = {Verifiable Stream Computation and Arthur-Merlin Communication}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {217--243}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.217}, doi = {10.4230/LIPICS.CCC.2015.217}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/ChakrabartiCMTV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/ChungWY15, author = {Kai{-}Min Chung and Xiaodi Wu and Henry S. Yuen}, editor = {David Zuckerman}, title = {Parallel Repetition for Entangled k-player Games via Fast Quantum Search}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {512--536}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.512}, doi = {10.4230/LIPICS.CCC.2015.512}, timestamp = {Thu, 01 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/ChungWY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/GalesiPT15, author = {Nicola Galesi and Pavel Pudl{\'{a}}k and Neil Thapen}, editor = {David Zuckerman}, title = {The Space Complexity of Cutting Planes Refutations}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {433--447}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.433}, doi = {10.4230/LIPICS.CCC.2015.433}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/GalesiPT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/GoldreichGK15, author = {Oded Goldreich and Tom Gur and Ilan Komargodski}, editor = {David Zuckerman}, title = {Strong Locally Testable Codes with Relaxed Local Decoders}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {1--41}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.1}, doi = {10.4230/LIPICS.CCC.2015.1}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/GoldreichGK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/GoldreichVW15, author = {Oded Goldreich and Emanuele Viola and Avi Wigderson}, editor = {David Zuckerman}, title = {On Randomness Extraction in {AC0}}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {601--668}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.601}, doi = {10.4230/LIPICS.CCC.2015.601}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/GoldreichVW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/GurjarKST15, author = {Rohit Gurjar and Arpita Korwar and Nitin Saxena and Thomas Thierauf}, editor = {David Zuckerman}, title = {Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {323--346}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.323}, doi = {10.4230/LIPICS.CCC.2015.323}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/GurjarKST15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/GuruswamiV15, author = {Venkatesan Guruswami and Ameya Velingker}, editor = {David Zuckerman}, title = {An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {42--57}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.42}, doi = {10.4230/LIPICS.CCC.2015.42}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/GuruswamiV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/HavivR15, author = {Ishay Haviv and Oded Regev}, editor = {David Zuckerman}, title = {The List-Decoding Size of Fourier-Sparse Boolean Functions}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {58--71}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.58}, doi = {10.4230/LIPICS.CCC.2015.58}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/HavivR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Hirahara15, author = {Shuichi Hirahara}, editor = {David Zuckerman}, title = {Identifying an Honest {EXPNP} Oracle Among Many}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {244--263}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.244}, doi = {10.4230/LIPICS.CCC.2015.244}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Hirahara15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/HrubesR15, author = {Pavel Hrubes and Anup Rao}, editor = {David Zuckerman}, title = {Circuits with Medium Fan-In}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {381--391}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.381}, doi = {10.4230/LIPICS.CCC.2015.381}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/HrubesR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Kane15, author = {Daniel M. Kane}, editor = {David Zuckerman}, title = {A Polylogarithmic {PRG} for Degree 2 Threshold Functions in the Gaussian Setting}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {567--581}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.567}, doi = {10.4230/LIPICS.CCC.2015.567}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Kane15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/KayalS15, author = {Neeraj Kayal and Chandan Saha}, editor = {David Zuckerman}, title = {Lower Bounds for Depth Three Arithmetic Circuits with Small Bottom Fanin}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {158--208}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.158}, doi = {10.4230/LIPICS.CCC.2015.158}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/KayalS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/KobayashiGN15, author = {Hirotada Kobayashi and Fran{\c{c}}ois Le Gall and Harumichi Nishimura}, editor = {David Zuckerman}, title = {Generalized Quantum Arthur-Merlin Games}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {488--511}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.488}, doi = {10.4230/LIPICS.CCC.2015.488}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/KobayashiGN15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/LauriaN15, author = {Massimo Lauria and Jakob Nordstr{\"{o}}m}, editor = {David Zuckerman}, title = {Tight Size-Degree Bounds for Sums-of-Squares Proofs}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {448--466}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.448}, doi = {10.4230/LIPICS.CCC.2015.448}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/LauriaN15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/LiTW15, author = {Fu Li and Iddo Tzameret and Zhengyu Wang}, editor = {David Zuckerman}, title = {Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {412--432}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.412}, doi = {10.4230/LIPICS.CCC.2015.412}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/LiTW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/LinL15, author = {Cedric Yen{-}Yu Lin and Han{-}Hsuan Lin}, editor = {David Zuckerman}, title = {Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {537--566}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.537}, doi = {10.4230/LIPICS.CCC.2015.537}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/LinL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/MiksaN15, author = {Mladen Miksa and Jakob Nordstr{\"{o}}m}, editor = {David Zuckerman}, title = {A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {467--487}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.467}, doi = {10.4230/LIPICS.CCC.2015.467}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/MiksaN15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/MurrayW15, author = {Cody D. Murray and Richard Ryan Williams}, editor = {David Zuckerman}, title = {On the (Non) NP-Hardness of Computing Circuit Complexity}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {365--380}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.365}, doi = {10.4230/LIPICS.CCC.2015.365}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/MurrayW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Oliveira15, author = {Rafael Mendes de Oliveira}, editor = {David Zuckerman}, title = {Factors of Low Individual Degree Polynomials}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {198--216}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.198}, doi = {10.4230/LIPICS.CCC.2015.198}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Oliveira15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/OliveiraS15, author = {Igor Carboni Oliveira and Rahul Santhanam}, editor = {David Zuckerman}, title = {Majority is Incompressible by AC0[p] Circuits}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {124--157}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.124}, doi = {10.4230/LIPICS.CCC.2015.124}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/OliveiraS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/OliveiraSV15, author = {Rafael Oliveira and Amir Shpilka and Ben Lee Volk}, editor = {David Zuckerman}, title = {Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {304--322}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.304}, doi = {10.4230/LIPICS.CCC.2015.304}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/OliveiraSV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/RamamoorthyR15, author = {Sivaramakrishnan Natarajan Ramamoorthy and Anup Rao}, editor = {David Zuckerman}, title = {How to Compress Asymmetric Communication}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {102--123}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.102}, doi = {10.4230/LIPICS.CCC.2015.102}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/RamamoorthyR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/RaoY15, author = {Anup Rao and Amir Yehudayoff}, editor = {David Zuckerman}, title = {Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {88--101}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.88}, doi = {10.4230/LIPICS.CCC.2015.88}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/RaoY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Rossman15, author = {Benjamin Rossman}, editor = {David Zuckerman}, title = {Correlation Bounds Against Monotone {NC1}}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {392--411}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.392}, doi = {10.4230/LIPICS.CCC.2015.392}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Rossman15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/SamorodnitskySY15, author = {Alex Samorodnitsky and Ilya D. Shkredov and Sergey Yekhanin}, editor = {David Zuckerman}, title = {Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {347--364}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.347}, doi = {10.4230/LIPICS.CCC.2015.347}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/SamorodnitskySY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/ServedioTW15, author = {Rocco A. Servedio and Li{-}Yang Tan and John Wright}, editor = {David Zuckerman}, title = {Adaptivity Helps for Testing Juntas}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {264--279}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.264}, doi = {10.4230/LIPICS.CCC.2015.264}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/ServedioTW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/X15, editor = {David Zuckerman}, title = {Front Matter, Table of Contents, Preface, Conference Organization}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {i--xiv}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.i}, doi = {10.4230/LIPICS.CCC.2015.I}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/X15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/coco/2015, editor = {David Zuckerman}, title = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {http://www.dagstuhl.de/dagpub/978-3-939897-81-1}, isbn = {978-3-939897-81-1}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/2015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.