Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:conf/coco:"
more than 1000 matches, exporting first 1000 hits only!
download as .bib file
@inproceedings{DBLP:conf/coco/000124,
author = {Michael A. Forbes},
editor = {Rahul Santhanam},
title = {Low-Depth Algebraic Circuit Lower Bounds over Any Field},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {31:1--31:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.31},
doi = {10.4230/LIPICS.CCC.2024.31},
timestamp = {Mon, 15 Jul 2024 16:11:42 +0200},
biburl = {https://dblp.org/rec/conf/coco/000124.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0006024,
author = {Xin Li and
Yan Zhong},
editor = {Rahul Santhanam},
title = {Explicit Directional Affine Extractors and Improved Hardness for Linear
Branching Programs},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {10:1--10:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.10},
doi = {10.4230/LIPICS.CCC.2024.10},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/0006024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AaronsonGRR24,
author = {Hugo Aaronson and
Tom Gur and
Ninad Rajgopal and
Ron D. Rothblum},
editor = {Rahul Santhanam},
title = {Distribution-Free Proofs of Proximity},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {24:1--24:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.24},
doi = {10.4230/LIPICS.CCC.2024.24},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AaronsonGRR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AlekseevFS24,
author = {Yaroslav Alekseev and
Yuval Filmus and
Alexander Smal},
editor = {Rahul Santhanam},
title = {Lifting Dichotomies},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {9:1--9:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.9},
doi = {10.4230/LIPICS.CCC.2024.9},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AlekseevFS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AlmanG24,
author = {Josh Alman and
Yunfeng Guan},
editor = {Rahul Santhanam},
title = {Finer-Grained Hardness of Kernel Density Estimation},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {35:1--35:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.35},
doi = {10.4230/LIPICS.CCC.2024.35},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AlmanG24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ArtecheCG24,
author = {Noel Arteche and
Gaia Carenini and
Matthew Gray},
editor = {Rahul Santhanam},
title = {Quantum Automating TC{\unicode{8304}}-Frege Is LWE-Hard},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {15:1--15:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.15},
doi = {10.4230/LIPICS.CCC.2024.15},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ArtecheCG24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AssadiGLMM24,
author = {Sepehr Assadi and
Prantar Ghosh and
Bruno Loff and
Parth Mittal and
Sagnik Mukhopadhyay},
editor = {Rahul Santhanam},
title = {Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {7:1--7:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.7},
doi = {10.4230/LIPICS.CCC.2024.7},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AssadiGLMM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BafnaM24,
author = {Mitali Bafna and
Dor Minzer},
editor = {Rahul Santhanam},
title = {Solving Unique Games over Globally Hypercontractive Graphs},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {3:1--3:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.3},
doi = {10.4230/LIPICS.CCC.2024.3},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BafnaM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BhattacharyaCD24,
author = {Sreejata Kishor Bhattacharya and
Arkadev Chattopadhyay and
Pavel Dvor{\'{a}}k},
editor = {Rahul Santhanam},
title = {Exponential Separation Between Powers of Regular and General Resolution
over Parities},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {23:1--23:32},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.23},
doi = {10.4230/LIPICS.CCC.2024.23},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BhattacharyaCD24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlancKST24,
author = {Guy Blanc and
Caleb Koch and
Carmen Strassle and
Li{-}Yang Tan},
editor = {Rahul Santhanam},
title = {A Strong Direct Sum Theorem for Distributional Query Complexity},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {16:1--16:30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.16},
doi = {10.4230/LIPICS.CCC.2024.16},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BlancKST24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BoulandFGMVZZ24,
author = {Adam Bouland and
Bill Fefferman and
Soumik Ghosh and
Tony Metger and
Umesh V. Vazirani and
Chenyi Zhang and
Zixin Zhou},
editor = {Rahul Santhanam},
title = {Public-Key Pseudoentanglement and the Hardness of Learning Ground
State Entanglement Structure},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {21:1--21:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.21},
doi = {10.4230/LIPICS.CCC.2024.21},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BoulandFGMVZZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BurgisserDM0W24,
author = {Peter B{\"{u}}rgisser and
Mahmut Levent Dogan and
Visu Makam and
Michael Walter and
Avi Wigderson},
editor = {Rahul Santhanam},
title = {Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {14:1--14:48},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.14},
doi = {10.4230/LIPICS.CCC.2024.14},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BurgisserDM0W24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChakrabartiS24,
author = {Amit Chakrabarti and
Manuel Stoeckl},
editor = {Rahul Santhanam},
title = {Finding Missing Items Requires Strong Forms of Randomness},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {28:1--28:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.28},
doi = {10.4230/LIPICS.CCC.2024.28},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ChakrabartiS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChatterjeeKSS24,
author = {Prerona Chatterjee and
Deepanshu Kush and
Shubhangi Saraf and
Amir Shpilka},
editor = {Rahul Santhanam},
title = {Lower Bounds for Set-Multilinear Branching Programs},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {20:1--20:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.20},
doi = {10.4230/LIPICS.CCC.2024.20},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ChatterjeeKSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChengW24,
author = {Kuan Cheng and
Yichuan Wang},
editor = {Rahul Santhanam},
title = {{BPL} {\(\subseteq\)} L-AC{\({^1}\)}},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {32:1--32:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.32},
doi = {10.4230/LIPICS.CCC.2024.32},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ChengW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CohenY24,
author = {Gil Cohen and
Tal Yankovitz},
editor = {Rahul Santhanam},
title = {Asymptotically-Good RLCCs with (log n)(2+o(1)) Queries},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {8:1--8:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.8},
doi = {10.4230/LIPICS.CCC.2024.8},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CohenY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CookM24,
author = {Joshua Cook and
Dana Moshkovitz},
editor = {Rahul Santhanam},
title = {Explicit Time and Space Efficient Encoders Exist Only with Random
Access},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {5:1--5:54},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.5},
doi = {10.4230/LIPICS.CCC.2024.5},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CookM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CormodeDGH24,
author = {Graham Cormode and
Marcel Dall'Agnol and
Tom Gur and
Chris Hickey},
editor = {Rahul Santhanam},
title = {Streaming Zero-Knowledge Proofs},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {2:1--2:66},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.2},
doi = {10.4230/LIPICS.CCC.2024.2},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CormodeDGH24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DerksenILV24,
author = {Harm Derksen and
Peter Ivanov and
Chin Ho Lee and
Emanuele Viola},
editor = {Rahul Santhanam},
title = {Pseudorandomness, Symmetry, Smoothing: {I}},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {18:1--18:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.18},
doi = {10.4230/LIPICS.CCC.2024.18},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DerksenILV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DongFNQXY24,
author = {Yangjing Dong and
Honghao Fu and
Anand Natarajan and
Minglong Qin and
Haochen Xu and
Penghui Yao},
editor = {Rahul Santhanam},
title = {The Computational Advantage of MIP{\({_\ast}\)} Vanishes in the Presence
of Noise},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {30:1--30:71},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.30},
doi = {10.4230/LIPICS.CCC.2024.30},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DongFNQXY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/EfremenkoKPRS24,
author = {Klim Efremenko and
Gillat Kol and
Dmitry Paramonov and
Ran Raz and
Raghuvansh R. Saxena},
editor = {Rahul Santhanam},
title = {Information Dissemination via Broadcasts in the Presence of Adversarial
Noise},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {19:1--19:33},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.19},
doi = {10.4230/LIPICS.CCC.2024.19},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/EfremenkoKPRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Garlik24,
author = {Michal Garl{\'{\i}}k},
editor = {Rahul Santhanam},
title = {Failure of Feasible Disjunction Property for k-DNF Resolution and
NP-Hardness of Automating It},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {33:1--33:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.33},
doi = {10.4230/LIPICS.CCC.2024.33},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Garlik24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GrewalY24,
author = {Sabee Grewal and
Justin Yirka},
editor = {Rahul Santhanam},
title = {The Entangled Quantum Polynomial Hierarchy Collapses},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {6:1--6:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.6},
doi = {10.4230/LIPICS.CCC.2024.6},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GrewalY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GurumukhaniPPST24,
author = {Mohit Gurumukhani and
Ramamohan Paturi and
Pavel Pudl{\'{a}}k and
Michael E. Saks and
Navid Talebanfard},
editor = {Rahul Santhanam},
title = {Local Enumeration and Majority Lower Bounds},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {17:1--17:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.17},
doi = {10.4230/LIPICS.CCC.2024.17},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GurumukhaniPPST24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiRS24,
author = {Venkatesan Guruswami and
Xuandi Ren and
Sai Sandeep},
editor = {Rahul Santhanam},
title = {Baby {PIH:} Parameterized Inapproximability of Min {CSP}},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {27:1--27:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.27},
doi = {10.4230/LIPICS.CCC.2024.27},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HiraharaKLO24,
author = {Shuichi Hirahara and
Valentine Kabanets and
Zhenjian Lu and
Igor C. Oliveira},
editor = {Rahul Santhanam},
title = {Exact Search-To-Decision Reductions for Time-Bounded Kolmogorov Complexity},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {29:1--29:56},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.29},
doi = {10.4230/LIPICS.CCC.2024.29},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/HiraharaKLO24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HolmgrenR24,
author = {Justin Holmgren and
Ron Rothblum},
editor = {Rahul Santhanam},
title = {Linear-Size Boolean Circuits for Multiselection},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {11:1--11:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.11},
doi = {10.4230/LIPICS.CCC.2024.11},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/HolmgrenR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hoza24,
author = {William M. Hoza},
editor = {Rahul Santhanam},
title = {A Technique for Hardness Amplification Against AC{\unicode{8304}}},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {1:1--1:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.1},
doi = {10.4230/LIPICS.CCC.2024.1},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Hoza24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hrubes24,
author = {Pavel Hrubes},
editor = {Rahul Santhanam},
title = {A Subquadratic Upper Bound on Sum-Of-Squares Composition Formulas},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {12:1--12:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.12},
doi = {10.4230/LIPICS.CCC.2024.12},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Hrubes24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hrubes24a,
author = {Pavel Hrubes},
editor = {Rahul Santhanam},
title = {Hard Submatrices for Non-Negative Rank and Communication Complexity},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {13:1--13:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.13},
doi = {10.4230/LIPICS.CCC.2024.13},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Hrubes24a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/JeronimoW24,
author = {Fernando Granha Jeronimo and
Pei Wu},
editor = {Rahul Santhanam},
title = {Dimension Independent Disentanglers from Unentanglement and Applications},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {26:1--26:28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.26},
doi = {10.4230/LIPICS.CCC.2024.26},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/JeronimoW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KedlayaK24,
author = {Kiran S. Kedlaya and
Swastik Kopparty},
editor = {Rahul Santhanam},
title = {On the Degree of Polynomials Computing Square Roots Mod p},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {25:1--25:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.25},
doi = {10.4230/LIPICS.CCC.2024.25},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KedlayaK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MazorP24,
author = {Noam Mazor and
Rafael Pass},
editor = {Rahul Santhanam},
title = {Search-To-Decision Reductions for Kolmogorov Complexity},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {34:1--34:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.34},
doi = {10.4230/LIPICS.CCC.2024.34},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/MazorP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MazorP24a,
author = {Noam Mazor and
Rafael Pass},
editor = {Rahul Santhanam},
title = {Gap {MCSP} Is Not (Levin) NP-Complete in Obfustopia},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {36:1--36:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.36},
doi = {10.4230/LIPICS.CCC.2024.36},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/MazorP24a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Papamakarios24,
author = {Theodoros Papamakarios},
editor = {Rahul Santhanam},
title = {Depth-d Frege Systems Are Not Automatable Unless {P} = {NP}},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {22:1--22:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.22},
doi = {10.4230/LIPICS.CCC.2024.22},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Papamakarios24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Pyne24,
author = {Edward Pyne},
editor = {Rahul Santhanam},
title = {Derandomizing Logspace with a Small Shared Hard Drive},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {4:1--4:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.4},
doi = {10.4230/LIPICS.CCC.2024.4},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Pyne24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/X24,
editor = {Rahul Santhanam},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
pages = {0:i--0:xiv},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CCC.2024.0},
doi = {10.4230/LIPICS.CCC.2024.0},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/X24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2024,
editor = {Rahul Santhanam},
title = {39th Computational Complexity Conference, {CCC} 2024, July 22-25,
2024, Ann Arbor, MI, {USA}},
series = {LIPIcs},
volume = {300},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-331-7},
isbn = {978-3-95977-331-7},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/2024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001GGR23,
author = {Abhranil Chatterjee and
Sumanta Ghosh and
Rohit Gurjar and
Roshan Raj},
editor = {Amnon Ta{-}Shma},
title = {Border Complexity of Symbolic Determinant Under Rank One Restriction},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {2:1--2:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.2},
doi = {10.4230/LIPICS.CCC.2023.2},
timestamp = {Mon, 10 Jul 2023 17:09:42 +0200},
biburl = {https://dblp.org/rec/conf/coco/0001GGR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001LY23,
author = {Xi Chen and
Yuhao Li and
Mihalis Yannakakis},
editor = {Amnon Ta{-}Shma},
title = {Reducing Tarski to Unique Tarski (In the Black-Box Model)},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {21:1--21:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.21},
doi = {10.4230/LIPICS.CCC.2023.21},
timestamp = {Wed, 04 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/0001LY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AbdolazimiG23,
author = {Dorna Abdolazimi and
Shayan Oveis Gharan},
editor = {Amnon Ta{-}Shma},
title = {An Improved Trickle down Theorem for Partite Complexes},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {10:1--10:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.10},
doi = {10.4230/LIPICS.CCC.2023.10},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AbdolazimiG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AharonovI23,
author = {Dorit Aharonov and
Sandy Irani},
editor = {Amnon Ta{-}Shma},
title = {Translationally Invariant Constraint Optimization Problems},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {23:1--23:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.23},
doi = {10.4230/LIPICS.CCC.2023.23},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AharonovI23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AlmanB23,
author = {Josh Alman and
Jaroslaw Blasiok},
editor = {Amnon Ta{-}Shma},
title = {Matrix Multiplication and Number on the Forehead Communication},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {16:1--16:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.16},
doi = {10.4230/LIPICS.CCC.2023.16},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AlmanB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmbainisB23,
author = {Andris Ambainis and
Aleksandrs Belovs},
editor = {Amnon Ta{-}Shma},
title = {An Exponential Separation Between Quantum Query Complexity and the
Polynomial Degree},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {24:1--24:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.24},
doi = {10.4230/LIPICS.CCC.2023.24},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AmbainisB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ArunachalamG23,
author = {Srinivasan Arunachalam and
Uma Girish},
editor = {Amnon Ta{-}Shma},
title = {Trade-Offs Between Entanglement and Communication},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {25:1--25:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.25},
doi = {10.4230/LIPICS.CCC.2023.25},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ArunachalamG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AustrinR23,
author = {Per Austrin and
Kilian Risse},
editor = {Amnon Ta{-}Shma},
title = {Sum-Of-Squares Lower Bounds for the Minimum Circuit Size Problem},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {31:1--31:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.31},
doi = {10.4230/LIPICS.CCC.2023.31},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AustrinR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BittelGK23,
author = {Lennart Bittel and
Sevag Gharibian and
Martin Kliesch},
editor = {Amnon Ta{-}Shma},
title = {The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to
Approximate},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {34:1--34:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.34},
doi = {10.4230/LIPICS.CCC.2023.34},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BittelGK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlockBCG0ZZ23,
author = {Alexander R. Block and
Jeremiah Blocki and
Kuan Cheng and
Elena Grigorescu and
Xin Li and
Yu Zheng and
Minshen Zhu},
editor = {Amnon Ta{-}Shma},
title = {On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion
Errors},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {14:1--14:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.14},
doi = {10.4230/LIPICS.CCC.2023.14},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlockBCG0ZZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CavalarO23,
author = {Bruno Pasqualotto Cavalar and
Igor C. Oliveira},
editor = {Amnon Ta{-}Shma},
title = {Constant-Depth Circuits vs. Monotone Circuits},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {29:1--29:37},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.29},
doi = {10.4230/LIPICS.CCC.2023.29},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CavalarO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChatterjeeH23,
author = {Prerona Chatterjee and
Pavel Hrubes},
editor = {Amnon Ta{-}Shma},
title = {New Lower Bounds Against Homogeneous Non-Commutative Circuits},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {13:1--13:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.13},
doi = {10.4230/LIPICS.CCC.2023.13},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ChatterjeeH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChattopadhyayL23,
author = {Eshan Chattopadhyay and
Jyun{-}Jie Liao},
editor = {Amnon Ta{-}Shma},
title = {Hardness Against Linear Branching Programs and More},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {9:1--9:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.9},
doi = {10.4230/LIPICS.CCC.2023.9},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ChattopadhyayL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CheungHHS23,
author = {Tsun{-}Ming Cheung and
Hamed Hatami and
Kaave Hosseini and
Morgan Shirley},
editor = {Amnon Ta{-}Shma},
title = {Separation of the Factorization Norm and Randomized Communication
Complexity},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {1:1--1:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.1},
doi = {10.4230/LIPICS.CCC.2023.1},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CheungHHS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChiaCHLLS23,
author = {Nai{-}Hui Chia and
Kai{-}Min Chung and
Yao{-}Ching Hsieh and
Han{-}Hsuan Lin and
Yao{-}Ting Lin and
Yu{-}Ching Shen},
editor = {Amnon Ta{-}Shma},
title = {On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian
Simulation},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {33:1--33:45},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.33},
doi = {10.4230/LIPICS.CCC.2023.33},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ChiaCHLLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Cohen023,
author = {Gil Cohen and
Itay Cohen},
editor = {Amnon Ta{-}Shma},
title = {Spectral Expanding Expanders},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {8:1--8:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.8},
doi = {10.4230/LIPICS.CCC.2023.8},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Cohen023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DavisR23,
author = {Ben Davis and
Robert Robere},
editor = {Amnon Ta{-}Shma},
title = {Colourful {TFNP} and Propositional Proofs},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {36:1--36:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.36},
doi = {10.4230/LIPICS.CCC.2023.36},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DavisR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DoronT23,
author = {Dean Doron and
Roei Tell},
editor = {Amnon Ta{-}Shma},
title = {Derandomization with Minimal Memory Footprint},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {11:1--11:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.11},
doi = {10.4230/LIPICS.CCC.2023.11},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DoronT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FournierLM0T23,
author = {Herv{\'{e}} Fournier and
Nutan Limaye and
Guillaume Malod and
Srikanth Srinivasan and
S{\'{e}}bastien Tavenas},
editor = {Amnon Ta{-}Shma},
title = {Towards Optimal Depth-Reductions for Algebraic Formulas},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {28:1--28:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.28},
doi = {10.4230/LIPICS.CCC.2023.28},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FournierLM0T23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GalesiGPS23,
author = {Nicola Galesi and
Joshua A. Grochow and
Toniann Pitassi and
Adrian She},
editor = {Amnon Ta{-}Shma},
title = {On the Algebraic Proof Complexity of Tensor Isomorphism},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {4:1--4:40},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.4},
doi = {10.4230/LIPICS.CCC.2023.4},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GalesiGPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Garg0PS23,
author = {Abhibhav Garg and
Rafael Oliveira and
Shir Peleg and
Akash Kumar Sengupta},
editor = {Amnon Ta{-}Shma},
title = {Radical Sylvester-Gallai Theorem for Tuples of Quadratics},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {20:1--20:30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.20},
doi = {10.4230/LIPICS.CCC.2023.20},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Garg0PS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoldbergK23,
author = {Halley Goldberg and
Valentine Kabanets},
editor = {Amnon Ta{-}Shma},
title = {Improved Learning from Kolmogorov Complexity},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {12:1--12:29},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.12},
doi = {10.4230/LIPICS.CCC.2023.12},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GoldbergK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HarshaMS23,
author = {Prahladh Harsha and
Tulasimohan Molli and
Ashutosh Shankar},
editor = {Amnon Ta{-}Shma},
title = {Criticality of AC{\unicode{8304}}-Formulae},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {19:1--19:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.19},
doi = {10.4230/LIPICS.CCC.2023.19},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/HarshaMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HiraharaLR23,
author = {Shuichi Hirahara and
Zhenjian Lu and
Hanlin Ren},
editor = {Amnon Ta{-}Shma},
title = {Bounded Relativization},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {6:1--6:45},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.6},
doi = {10.4230/LIPICS.CCC.2023.6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/HiraharaLR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HuNR23,
author = {Lunjia Hu and
Inbal Livni Navon and
Omer Reingold},
editor = {Amnon Ta{-}Shma},
title = {Generative Models of Huge Objects},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {5:1--5:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.5},
doi = {10.4230/LIPICS.CCC.2023.5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/HuNR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoMP23,
author = {Russell Impagliazzo and
Sasank Mouli and
Toniann Pitassi},
editor = {Amnon Ta{-}Shma},
title = {Lower Bounds for Polynomial Calculus with Extension Variables over
Finite Fields},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {7:1--7:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.7},
doi = {10.4230/LIPICS.CCC.2023.7},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/IvanovPV23,
author = {Peter Ivanov and
Liam Pavlovic and
Emanuele Viola},
editor = {Amnon Ta{-}Shma},
title = {On Correlation Bounds Against Polynomials},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {3:1--3:35},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.3},
doi = {10.4230/LIPICS.CCC.2023.3},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/IvanovPV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Kumar23,
author = {Vinayak M. Kumar},
editor = {Amnon Ta{-}Shma},
title = {Tight Correlation Bounds for Circuits Between {AC0} and {TC0}},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {18:1--18:40},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.18},
doi = {10.4230/LIPICS.CCC.2023.18},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Kumar23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KuniskyY23,
author = {Dmitriy Kunisky and
Xifan Yu},
editor = {Amnon Ta{-}Shma},
title = {A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the
Paley Graph},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {30:1--30:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.30},
doi = {10.4230/LIPICS.CCC.2023.30},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KuniskyY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KushS23,
author = {Deepanshu Kush and
Shubhangi Saraf},
editor = {Amnon Ta{-}Shma},
title = {Near-Optimal Set-Multilinear Formula Lower Bounds},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {15:1--15:33},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.15},
doi = {10.4230/LIPICS.CCC.2023.15},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KushS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LiuP23,
author = {Yanyi Liu and
Rafael Pass},
editor = {Amnon Ta{-}Shma},
title = {Leakage-Resilient Hardness vs Randomness},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {32:1--32:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.32},
doi = {10.4230/LIPICS.CCC.2023.32},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/LiuP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MelkebeekS23,
author = {Dieter van Melkebeek and
Nicollas M. Sdroievski},
editor = {Amnon Ta{-}Shma},
title = {Instance-Wise Hardness Versus Randomness Tradeoffs for Arthur-Merlin
Protocols},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {17:1--17:36},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.17},
doi = {10.4230/LIPICS.CCC.2023.17},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/MelkebeekS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/NatarajanN23,
author = {Anand Natarajan and
Chinmay Nirkhe},
editor = {Amnon Ta{-}Shma},
title = {A Distribution Testing Oracle Separating {QMA} and {QCMA}},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {22:1--22:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.22},
doi = {10.4230/LIPICS.CCC.2023.22},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/NatarajanN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Santhanam23,
author = {Rahul Santhanam},
editor = {Amnon Ta{-}Shma},
title = {An Algorithmic Approach to Uniform Lower Bounds},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {35:1--35:26},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.35},
doi = {10.4230/LIPICS.CCC.2023.35},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Santhanam23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Viola23,
author = {Emanuele Viola},
editor = {Amnon Ta{-}Shma},
title = {New Sampling Lower Bounds via the Separator},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {26:1--26:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.26},
doi = {10.4230/LIPICS.CCC.2023.26},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Viola23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/X23,
editor = {Amnon Ta{-}Shma},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {0:1--0:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.0},
doi = {10.4230/LIPICS.CCC.2023.0},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/X23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/dOrsiT23,
author = {Tommaso d'Orsi and
Luca Trevisan},
editor = {Amnon Ta{-}Shma},
title = {A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations
of Random CSPs},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {27:1--27:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.27},
doi = {10.4230/LIPICS.CCC.2023.27},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/dOrsiT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2023,
editor = {Amnon Ta{-}Shma},
title = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-282-2},
isbn = {978-3-95977-282-2},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/000122,
author = {Dmitry Sokolov},
editor = {Shachar Lovett},
title = {Pseudorandom Generators, Resolution and Heavy Width},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {15:1--15:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.15},
doi = {10.4230/LIPICS.CCC.2022.15},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/000122.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001L022,
author = {Lijie Chen and
Jiatu Li and
Tianqi Yang},
editor = {Shachar Lovett},
title = {Extremely Efficient Constructions of Hash Functions, with Applications
to Hardness Magnification and PRFs},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {23:1--23:37},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.23},
doi = {10.4230/LIPICS.CCC.2022.23},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/0001L022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001SW22,
author = {Nikhil Bansal and
Makrand Sinha and
Ronald de Wolf},
editor = {Shachar Lovett},
title = {Influence in Completely Bounded Block-Multilinear Forms and Classical
Simulation of Quantum Algorithms},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {28:1--28:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.28},
doi = {10.4230/LIPICS.CCC.2022.28},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/0001SW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AaronsonIK22,
author = {Scott Aaronson and
DeVon Ingram and
William Kretschmer},
editor = {Shachar Lovett},
title = {The Acrobatics of {BQP}},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {20:1--20:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.20},
doi = {10.4230/LIPICS.CCC.2022.20},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AaronsonIK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AggarwalA22,
author = {Amol Aggarwal and
Josh Alman},
editor = {Shachar Lovett},
title = {Optimal-Degree Polynomial Approximations for Exponentials and Gaussian
Kernel Density Estimation},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {22:1--22:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.22},
doi = {10.4230/LIPICS.CCC.2022.22},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AggarwalA22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ArnonCY22,
author = {Gal Arnon and
Alessandro Chiesa and
Eylon Yogev},
editor = {Shachar Lovett},
title = {Hardness of Approximation for Stochastic Problems via Interactive
Oracle Proofs},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {24:1--24:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.24},
doi = {10.4230/LIPICS.CCC.2022.24},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ArnonCY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ArvindJ22,
author = {Vikraman Arvind and
Pushkar S. Joglekar},
editor = {Shachar Lovett},
title = {On Efficient Noncommutative Polynomial Factorization via Higman Linearization},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {12:1--12:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.12},
doi = {10.4230/LIPICS.CCC.2022.12},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ArvindJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Beniamini22,
author = {Gal Beniamini},
editor = {Shachar Lovett},
title = {The Approximate Degree of Bipartite Perfect Matching},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {1:1--1:26},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.1},
doi = {10.4230/LIPICS.CCC.2022.1},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Beniamini22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BhandariHS022,
author = {Siddharth Bhandari and
Prahladh Harsha and
Ramprasad Saptharishi and
Srikanth Srinivasan},
editor = {Shachar Lovett},
title = {Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {31:1--31:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.31},
doi = {10.4230/LIPICS.CCC.2022.31},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BhandariHS022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlancD22,
author = {Guy Blanc and
Dean Doron},
editor = {Shachar Lovett},
title = {New Near-Linear Time Decodable Codes Closer to the {GV} Bound},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {10:1--10:40},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.10},
doi = {10.4230/LIPICS.CCC.2022.10},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BlancD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BogdanovHPP22,
author = {Andrej Bogdanov and
William M. Hoza and
Gautam Prakriya and
Edward Pyne},
editor = {Shachar Lovett},
title = {Hitting Sets for Regular Branching Programs},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {3:1--3:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.3},
doi = {10.4230/LIPICS.CCC.2022.3},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BogdanovHPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BordageLNR22,
author = {Sarah Bordage and
Mathieu Lhotel and
Jade Nardi and
Hugues Randriam},
editor = {Shachar Lovett},
title = {Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {30:1--30:45},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.30},
doi = {10.4230/LIPICS.CCC.2022.30},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BordageLNR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CookM22,
author = {James Cook and
Ian Mertz},
editor = {Shachar Lovett},
title = {Trading Time and Space in Catalytic Branching Programs},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {8:1--8:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.8},
doi = {10.4230/LIPICS.CCC.2022.8},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CookM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DerksenMZ22,
author = {Harm Derksen and
Visu Makam and
Jeroen Zuiddam},
editor = {Shachar Lovett},
title = {Subrank and Optimal Reduction of Scalar Multiplications to Generic
Tensors},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {9:1--9:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.9},
doi = {10.4230/LIPICS.CCC.2022.9},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DerksenMZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoldbergKLO22,
author = {Halley Goldberg and
Valentine Kabanets and
Zhenjian Lu and
Igor C. Oliveira},
editor = {Shachar Lovett},
title = {Probabilistic Kolmogorov Complexity with Applications to Average-Case
Complexity},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {16:1--16:60},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.16},
doi = {10.4230/LIPICS.CCC.2022.16},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GoldbergKLO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GolowichV22,
author = {Louis Golowich and
Salil P. Vadhan},
editor = {Shachar Lovett},
title = {Pseudorandomness of Expander Random Walks for Symmetric Functions
and Permutation Branching Programs},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {27:1--27:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.27},
doi = {10.4230/LIPICS.CCC.2022.27},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GolowichV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoosH0MPRT22,
author = {Mika G{\"{o}}{\"{o}}s and
Alexandros Hollender and
Siddhartha Jain and
Gilbert Maystre and
William Pires and
Robert Robere and
Ran Tao},
editor = {Shachar Lovett},
title = {Further Collapses in {TFNP}},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {33:1--33:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.33},
doi = {10.4230/LIPICS.CCC.2022.33},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoosH0MPRT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GryaznovPT22,
author = {Svyatoslav Gryaznov and
Pavel Pudl{\'{a}}k and
Navid Talebanfard},
editor = {Shachar Lovett},
title = {Linear Branching Programs and Directional Affine Extractors},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {4:1--4:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.4},
doi = {10.4230/LIPICS.CCC.2022.4},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GryaznovPT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiMM22,
author = {Venkatesan Guruswami and
Peter Manohar and
Jonathan Mosheiff},
editor = {Shachar Lovett},
title = {{\(\mathscr{l}\)}\({}_{\mbox{p}}\)-Spread and Restricted Isometry
Properties of Sparse Random Matrices},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {7:1--7:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.7},
doi = {10.4230/LIPICS.CCC.2022.7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiMM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hirahara22,
author = {Shuichi Hirahara},
editor = {Shachar Lovett},
title = {Symmetry of Information from Meta-Complexity},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {26:1--26:41},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.26},
doi = {10.4230/LIPICS.CCC.2022.26},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Hirahara22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HiraharaN22,
author = {Shuichi Hirahara and
Mikito Nanashima},
editor = {Shachar Lovett},
title = {Finding Errorless Pessiland in Error-Prone Heuristica},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {25:1--25:28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.25},
doi = {10.4230/LIPICS.CCC.2022.25},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/HiraharaN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HsiehMX22,
author = {Jun{-}Ting Hsieh and
Sidhanth Mohanty and
Jeff Xu},
editor = {Shachar Lovett},
title = {Certifying Solution Geometry in Random CSPs: Counts, Clusters and
Balance},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {11:1--11:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.11},
doi = {10.4230/LIPICS.CCC.2022.11},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/HsiehMX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/IraniNNRY22,
author = {Sandy Irani and
Anand Natarajan and
Chinmay Nirkhe and
Sujit Rao and
Henry Yuen},
editor = {Shachar Lovett},
title = {Quantum Search-To-Decision Reductions and the State Synthesis Problem},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {5:1--5:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.5},
doi = {10.4230/LIPICS.CCC.2022.5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/IraniNNRY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KarlinerST22,
author = {Dan Karliner and
Roie Salama and
Amnon Ta{-}Shma},
editor = {Shachar Lovett},
title = {The Plane Test Is a Local Tester for Multiplicity Codes},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {14:1--14:33},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.14},
doi = {10.4230/LIPICS.CCC.2022.14},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KarlinerST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KelleyM22,
author = {Zander Kelley and
Raghu Meka},
editor = {Shachar Lovett},
title = {Random Restrictions and PRGs for PTFs in Gaussian Space},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {21:1--21:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.21},
doi = {10.4230/LIPICS.CCC.2022.21},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KelleyM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Khaniki22,
author = {Erfan Khaniki},
editor = {Shachar Lovett},
title = {Nisan-Wigderson Generators in Proof Complexity: New Lower Bounds},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {17:1--17:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.17},
doi = {10.4230/LIPICS.CCC.2022.17},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Khaniki22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Korten22,
author = {Oliver Korten},
editor = {Shachar Lovett},
title = {Derandomization from Time-Space Tradeoffs},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {37:1--37:26},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.37},
doi = {10.4230/LIPICS.CCC.2022.37},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Korten22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KushS22,
author = {Deepanshu Kush and
Shubhangi Saraf},
editor = {Shachar Lovett},
title = {Improved Low-Depth Set-Multilinear Circuit Lower Bounds},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {38:1--38:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.38},
doi = {10.4230/LIPICS.CCC.2022.38},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KushS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LecomteRT22,
author = {Victor Lecomte and
Prasanna Ramakrishnan and
Li{-}Yang Tan},
editor = {Shachar Lovett},
title = {The Composition Complexity of Majority},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {19:1--19:26},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.19},
doi = {10.4230/LIPICS.CCC.2022.19},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/LecomteRT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Limaye0T22,
author = {Nutan Limaye and
Srikanth Srinivasan and
S{\'{e}}bastien Tavenas},
editor = {Shachar Lovett},
title = {On the Partial Derivative Method Applied to Lopsided Set-Multilinear
Polynomials},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {32:1--32:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.32},
doi = {10.4230/LIPICS.CCC.2022.32},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Limaye0T22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LiuP22,
author = {Yanyi Liu and
Rafael Pass},
editor = {Shachar Lovett},
title = {Characterizing Derandomization Through Hardness of Levin-Kolmogorov
Complexity},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {35:1--35:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.35},
doi = {10.4230/LIPICS.CCC.2022.35},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/LiuP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LiuP22a,
author = {Yanyi Liu and
Rafael Pass},
editor = {Shachar Lovett},
title = {On One-Way Functions from NP-Complete Problems},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {36:1--36:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.36},
doi = {10.4230/LIPICS.CCC.2022.36},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/LiuP22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Lyu22,
author = {Xin Lyu},
editor = {Shachar Lovett},
title = {Improved Pseudorandom Generators for AC{\unicode{8304}} Circuits},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {34:1--34:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.34},
doi = {10.4230/LIPICS.CCC.2022.34},
timestamp = {Sun, 20 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Lyu22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MihajlinS22,
author = {Ivan Mihajlin and
Anastasia Sofronova},
editor = {Shachar Lovett},
title = {A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with
Restrictions on Top Gates},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {13:1--13:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.13},
doi = {10.4230/LIPICS.CCC.2022.13},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/MihajlinS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ODonnellP22,
author = {Ryan O'Donnell and
Kevin Pratt},
editor = {Shachar Lovett},
title = {High-Dimensional Expanders from Chevalley Groups},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {18:1--18:26},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.18},
doi = {10.4230/LIPICS.CCC.2022.18},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ODonnellP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SK22,
author = {{Karthik {C. S.}} and
Subhash Khot},
editor = {Shachar Lovett},
title = {Almost Polynomial Factor Inapproximability for Parameterized k-Clique},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {6:1--6:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.6},
doi = {10.4230/LIPICS.CCC.2022.6},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SaksS22,
author = {Michael E. Saks and
Rahul Santhanam},
editor = {Shachar Lovett},
title = {On Randomized Reductions to the Random Strings},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {29:1--29:30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.29},
doi = {10.4230/LIPICS.CCC.2022.29},
timestamp = {Thu, 12 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SaksS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Tantau22,
author = {Till Tantau},
editor = {Shachar Lovett},
title = {On the Satisfaction Probability of k-CNF Formulas},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {2:1--2:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.2},
doi = {10.4230/LIPICS.CCC.2022.2},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Tantau22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/X22,
editor = {Shachar Lovett},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {0:1--0:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.0},
doi = {10.4230/LIPICS.CCC.2022.0},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/X22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2022,
editor = {Shachar Lovett},
title = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-241-9},
isbn = {978-3-95977-241-9},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001K21,
author = {Rahul Jain and
Srijita Kundu},
editor = {Valentine Kabanets},
title = {A Direct Product Theorem for One-Way Quantum Communication},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {27:1--27:28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.27},
doi = {10.4230/LIPICS.CCC.2021.27},
timestamp = {Thu, 02 Feb 2023 13:27:03 +0100},
biburl = {https://dblp.org/rec/conf/coco/0001K21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001V21,
author = {Mrinal Kumar and
Ben Lee Volk},
editor = {Valentine Kabanets},
title = {A Lower Bound on Determinantal Complexity},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {4:1--4:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.4},
doi = {10.4230/LIPICS.CCC.2021.4},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/0001V21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001W21,
author = {Oded Goldreich and
Avi Wigderson},
editor = {Valentine Kabanets},
title = {Robustly Self-Ordered Graphs: Constructions and Applications to Property
Testing},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {12:1--12:74},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.12},
doi = {10.4230/LIPICS.CCC.2021.12},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/0001W21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AdlerK021,
author = {Isolde Adler and
Noleen K{\"{o}}hler and
Pan Peng},
editor = {Valentine Kabanets},
title = {GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {34:1--34:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.34},
doi = {10.4230/LIPICS.CCC.2021.34},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AdlerK021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Alekseev21,
author = {Yaroslav Alekseev},
editor = {Valentine Kabanets},
title = {A Lower Bound for Polynomial Calculus with Extension Rule},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {21:1--21:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.21},
doi = {10.4230/LIPICS.CCC.2021.21},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Alekseev21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AnshuBK21,
author = {Anurag Anshu and
Shalev Ben{-}David and
Srijita Kundu},
editor = {Valentine Kabanets},
title = {On Query-To-Communication Lifting for Adversary Bounds},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {30:1--30:39},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.30},
doi = {10.4230/LIPICS.CCC.2021.30},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AnshuBK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ApersL21,
author = {Simon Apers and
Troy Lee},
editor = {Valentine Kabanets},
title = {Quantum Complexity of Minimum Cut},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {28:1--28:33},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.28},
doi = {10.4230/LIPICS.CCC.2021.28},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ApersL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BabaiK21,
author = {L{\'{a}}szl{\'{o}} Babai and
Bohdan Kivva},
editor = {Valentine Kabanets},
title = {Matrix Rigidity Depends on the Target Field},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {41:1--41:26},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.41},
doi = {10.4230/LIPICS.CCC.2021.41},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BabaiK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ball0M21,
author = {Marshall Ball and
Oded Goldreich and
Tal Malkin},
editor = {Valentine Kabanets},
title = {Communication Complexity with Defective Randomness},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {14:1--14:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.14},
doi = {10.4230/LIPICS.CCC.2021.14},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ball0M21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaserDI21,
author = {Markus Bl{\"{a}}ser and
Julian D{\"{o}}rfler and
Christian Ikenmeyer},
editor = {Valentine Kabanets},
title = {On the Complexity of Evaluating Highest Weight Vectors},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {29:1--29:36},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.29},
doi = {10.4230/LIPICS.CCC.2021.29},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaserDI21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BravermanM21,
author = {Mark Braverman and
Dor Minzer},
editor = {Valentine Kabanets},
title = {Optimal Tiling of the Euclidean Space Using Permutation-Symmetric
Bodies},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {5:1--5:48},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.5},
doi = {10.4230/LIPICS.CCC.2021.5},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BravermanM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BurgisserDMWW21,
author = {Peter B{\"{u}}rgisser and
M. Levent Dogan and
Visu Makam and
Michael Walter and
Avi Wigderson},
editor = {Valentine Kabanets},
title = {Polynomial Time Algorithms in Invariant Theory for Torus Actions},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {32:1--32:30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.32},
doi = {10.4230/LIPICS.CCC.2021.32},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BurgisserDMWW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Chatterjee21,
author = {Prerona Chatterjee},
editor = {Valentine Kabanets},
title = {Separating ABPs and Some Structured Formulas in the Non-Commutative
Setting},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {7:1--7:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.7},
doi = {10.4230/LIPICS.CCC.2021.7},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Chatterjee21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChattopadhyayGL21,
author = {Eshan Chattopadhyay and
Jason Gaitonde and
Chin Ho Lee and
Shachar Lovett and
Abhishek Shetty},
editor = {Valentine Kabanets},
title = {Fractional Pseudorandom Generators from Any Fourier Level},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {10:1--10:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.10},
doi = {10.4230/LIPICS.CCC.2021.10},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChattopadhyayGL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CohenDRST21,
author = {Gil Cohen and
Dean Doron and
Oren Renard and
Ori Sberlo and
Amnon Ta{-}Shma},
editor = {Valentine Kabanets},
title = {Error Reduction for Weighted PRGs Against Read Once Branching Programs},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {22:1--22:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.22},
doi = {10.4230/LIPICS.CCC.2021.22},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CohenDRST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CohenY21,
author = {Gil Cohen and
Tal Yankovitz},
editor = {Valentine Kabanets},
title = {Rate Amplification and Query-Efficient Distance Amplification for
Linear {LCC} and {LDC}},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {1:1--1:57},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.1},
doi = {10.4230/LIPICS.CCC.2021.1},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CohenY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DuttaD021,
author = {Pranjal Dutta and
Prateek Dwivedi and
Nitin Saxena},
editor = {Valentine Kabanets},
title = {Deterministic Identity Testing Paradigms for Bounded Top-Fanin Depth-4
Circuits},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {11:1--11:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.11},
doi = {10.4230/LIPICS.CCC.2021.11},
timestamp = {Thu, 07 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DuttaD021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DuttaJ0S21,
author = {Pranjal Dutta and
Gorav Jindal and
Anurag Pandey and
Amit Sinhababu},
editor = {Valentine Kabanets},
title = {Arithmetic Circuit Complexity of Division and Truncation},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {25:1--25:36},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.25},
doi = {10.4230/LIPICS.CCC.2021.25},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DuttaJ0S21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FlemingGIPRTW21,
author = {Noah Fleming and
Mika G{\"{o}}{\"{o}}s and
Russell Impagliazzo and
Toniann Pitassi and
Robert Robere and
Li{-}Yang Tan and
Avi Wigderson},
editor = {Valentine Kabanets},
title = {On the Power and Limitations of Branch and Cut},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {6:1--6:30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.6},
doi = {10.4230/LIPICS.CCC.2021.6},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/FlemingGIPRTW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FranksR21,
author = {William Cole Franks and
Philipp Reichenbach},
editor = {Valentine Kabanets},
title = {Barriers for Recent Methods in Geodesic Optimization},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {13:1--13:54},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.13},
doi = {10.4230/LIPICS.CCC.2021.13},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FranksR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GirishT021,
author = {Uma Girish and
Avishay Tal and
Kewen Wu},
editor = {Valentine Kabanets},
title = {Fourier Growth of Parity Decision Trees},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {39:1--39:36},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.39},
doi = {10.4230/LIPICS.CCC.2021.39},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GirishT021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoldwasserIPS21,
author = {Shafi Goldwasser and
Russell Impagliazzo and
Toniann Pitassi and
Rahul Santhanam},
editor = {Valentine Kabanets},
title = {On the Pseudo-Deterministic Query Complexity of {NP} Search Problems},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {36:1--36:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.36},
doi = {10.4230/LIPICS.CCC.2021.36},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GoldwasserIPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GolovnevH21,
author = {Alexander Golovnev and
Ishay Haviv},
editor = {Valentine Kabanets},
title = {The (Generalized) Orthogonality Dimension of (Generalized) Kneser
Graphs: Bounds and Applications},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {8:1--8:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.8},
doi = {10.4230/LIPICS.CCC.2021.8},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GolovnevH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoosM21,
author = {Mika G{\"{o}}{\"{o}}s and
Gilbert Maystre},
editor = {Valentine Kabanets},
title = {A Majority Lemma for Randomised Query Complexity},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {18:1--18:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.18},
doi = {10.4230/LIPICS.CCC.2021.18},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoosM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GrochowQ21,
author = {Joshua A. Grochow and
Youming Qiao},
editor = {Valentine Kabanets},
title = {On p-Group Isomorphism: Search-To-Decision, Counting-To-Decision,
and Nilpotency Class Reductions via Tensors},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {16:1--16:38},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.16},
doi = {10.4230/LIPICS.CCC.2021.16},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GrochowQ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Guo21,
author = {Zeyu Guo},
editor = {Valentine Kabanets},
title = {Variety Evasive Subspace Families},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {20:1--20:33},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.20},
doi = {10.4230/LIPICS.CCC.2021.20},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Guo21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HiraharaIL21,
author = {Shuichi Hirahara and
Rahul Ilango and
Bruno Loff},
editor = {Valentine Kabanets},
title = {Hardness of Constant-Round Communication Complexity},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {31:1--31:30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.31},
doi = {10.4230/LIPICS.CCC.2021.31},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HiraharaIL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HrubesY21,
author = {Pavel Hrubes and
Amir Yehudayoff},
editor = {Valentine Kabanets},
title = {Shadows of Newton Polytopes},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {9:1--9:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.9},
doi = {10.4230/LIPICS.CCC.2021.9},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HrubesY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ItsyksonR21,
author = {Dmitry Itsykson and
Artur Riazanov},
editor = {Valentine Kabanets},
title = {Proof Complexity of Natural Formulas via Communication Arguments},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {3:1--3:34},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.3},
doi = {10.4230/LIPICS.CCC.2021.3},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ItsyksonR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/IyerTW21,
author = {Vishnu Iyer and
Avishay Tal and
Michael Whitmeyer},
editor = {Valentine Kabanets},
title = {Junta Distance Approximation with Sub-Exponential Queries},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {24:1--24:38},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.24},
doi = {10.4230/LIPICS.CCC.2021.24},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/IyerTW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KamathPW21,
author = {Akshay Kamath and
Eric Price and
David P. Woodruff},
editor = {Valentine Kabanets},
title = {A Simple Proof of a New Set Disjointness with Applications to Data
Streams},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {37:1--37:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.37},
doi = {10.4230/LIPICS.CCC.2021.37},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KamathPW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KothariM21,
author = {Pravesh K. Kothari and
Peter Manohar},
editor = {Valentine Kabanets},
title = {A Stress-Free Sum-Of-Squares Lower Bound for Coloring},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {23:1--23:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.23},
doi = {10.4230/LIPICS.CCC.2021.23},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KothariM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeLSZ21,
author = {Troy Lee and
Tongyang Li and
Miklos Santha and
Shengyu Zhang},
editor = {Valentine Kabanets},
title = {On the Cut Dimension of a Graph},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {15:1--15:35},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.15},
doi = {10.4230/LIPICS.CCC.2021.15},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LeeLSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LinialS21,
author = {Nati Linial and
Adi Shraibman},
editor = {Valentine Kabanets},
title = {An Improved Protocol for the Exactly-N Problem},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {2:1--2:8},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.2},
doi = {10.4230/LIPICS.CCC.2021.2},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LinialS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MediniS21,
author = {Dori Medini and
Amir Shpilka},
editor = {Valentine Kabanets},
title = {Hitting Sets and Reconstruction for Dense Orbits in VP{\_}\{e\} and
{\(\Sigma\)}{\(\Pi\)}{\(\Sigma\)} Circuits},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {19:1--19:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.19},
doi = {10.4230/LIPICS.CCC.2021.19},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/MediniS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MihajlinS21,
author = {Ivan Mihajlin and
Alexander Smal},
editor = {Valentine Kabanets},
title = {Toward Better Depth Lower Bounds: The {XOR-KRW} Conjecture},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {38:1--38:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.38},
doi = {10.4230/LIPICS.CCC.2021.38},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/MihajlinS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Pang21,
author = {Shuo Pang},
editor = {Valentine Kabanets},
title = {{SOS} Lower Bound for Exact Planted Clique},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {26:1--26:63},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.26},
doi = {10.4230/LIPICS.CCC.2021.26},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Pang21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/PyneV21,
author = {Edward Pyne and
Salil P. Vadhan},
editor = {Valentine Kabanets},
title = {Pseudodistributions That Beat All Pseudorandom Generators (Extended
Abstract)},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {33:1--33:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.33},
doi = {10.4230/LIPICS.CCC.2021.33},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/PyneV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/RenS21,
author = {Hanlin Ren and
Rahul Santhanam},
editor = {Valentine Kabanets},
title = {Hardness of {KT} Characterizes Parallel Cryptography},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {35:1--35:58},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.35},
doi = {10.4230/LIPICS.CCC.2021.35},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/RenS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/RezendeLN021,
author = {Susanna F. de Rezende and
Massimo Lauria and
Jakob Nordstr{\"{o}}m and
Dmitry Sokolov},
editor = {Valentine Kabanets},
title = {The Power of Negative Reasoning},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {40:1--40:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.40},
doi = {10.4230/LIPICS.CCC.2021.40},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/RezendeLN021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Sofronova021,
author = {Anastasia Sofronova and
Dmitry Sokolov},
editor = {Valentine Kabanets},
title = {Branching Programs with Bounded Repetitions and Flow Formulas},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {17:1--17:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.17},
doi = {10.4230/LIPICS.CCC.2021.17},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Sofronova021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/X21,
editor = {Valentine Kabanets},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {0:1--0:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.0},
doi = {10.4230/LIPICS.CCC.2021.0},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/X21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2021,
editor = {Valentine Kabanets},
title = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-193-1},
isbn = {978-3-95977-193-1},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001CMP20,
author = {Sourav Chakraborty and
Arkadev Chattopadhyay and
Nikhil S. Mande and
Manaswi Paraashar},
editor = {Shubhangi Saraf},
title = {Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {32:1--32:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.32},
doi = {10.4230/LIPICS.CCC.2020.32},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/0001CMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001V20,
author = {Mrinal Kumar and
Ben Lee Volk},
editor = {Shubhangi Saraf},
title = {Lower Bounds for Matrix Factorization},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {5:1--5:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.5},
doi = {10.4230/LIPICS.CCC.2020.5},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/0001V20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/000320,
author = {Robert Andrews},
editor = {Shubhangi Saraf},
title = {Algebraic Hardness Versus Randomness in Low Characteristic},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {37:1--37:32},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.37},
doi = {10.4230/LIPICS.CCC.2020.37},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/000320.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AaronsonCLWZ20,
author = {Scott Aaronson and
Nai{-}Hui Chia and
Han{-}Hsuan Lin and
Chunhao Wang and
Ruizhe Zhang},
editor = {Shubhangi Saraf},
title = {On the Quantum Complexity of Closest Pair and Related Problems},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {16:1--16:43},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.16},
doi = {10.4230/LIPICS.CCC.2020.16},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AaronsonCLWZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AaronsonKKT20,
author = {Scott Aaronson and
Robin Kothari and
William Kretschmer and
Justin Thaler},
editor = {Shubhangi Saraf},
title = {Quantum Lower Bounds for Approximate Counting via Laurent Polynomials},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {7:1--7:47},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.7},
doi = {10.4230/LIPICS.CCC.2020.7},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AaronsonKKT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BartholdiFLW20,
author = {Laurent Bartholdi and
Michael Figelius and
Markus Lohrey and
Armin Wei{\ss}},
editor = {Shubhangi Saraf},
title = {Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit
Value Problems},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {29:1--29:29},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.29},
doi = {10.4230/LIPICS.CCC.2020.29},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BartholdiFLW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-AroyaDT20,
author = {Avraham Ben{-}Aroya and
Dean Doron and
Amnon Ta{-}Shma},
editor = {Shubhangi Saraf},
title = {Near-Optimal Erasure List-Decodable Codes},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {1:1--1:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.1},
doi = {10.4230/LIPICS.CCC.2020.1},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ben-AroyaDT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BennettP20,
author = {Huck Bennett and
Chris Peikert},
editor = {Shubhangi Saraf},
title = {Hardness of Bounded Distance Decoding on Lattices in {\(\mathscr{l}\)}\({}_{\mbox{p}}\)
Norms},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {36:1--36:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.36},
doi = {10.4230/LIPICS.CCC.2020.36},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BennettP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BhangaleK20,
author = {Amey Bhangale and
Subhash Khot},
editor = {Shubhangi Saraf},
title = {Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {9:1--9:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.9},
doi = {10.4230/LIPICS.CCC.2020.9},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BhangaleK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaserIMPS20,
author = {Markus Bl{\"{a}}ser and
Christian Ikenmeyer and
Meena Mahajan and
Anurag Pandey and
Nitin Saurabh},
editor = {Shubhangi Saraf},
title = {Algebraic Branching Programs, Border Complexity, and Tangent Spaces},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {21:1--21:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.21},
doi = {10.4230/LIPICS.CCC.2020.21},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaserIMPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CaiLLY20,
author = {Jin{-}Yi Cai and
Tianyu Liu and
Pinyan Lu and
Jing Yu},
editor = {Shubhangi Saraf},
title = {Approximability of the Eight-Vertex Model},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {4:1--4:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.4},
doi = {10.4230/LIPICS.CCC.2020.4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CaiLLY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Chatterjee0SV20,
author = {Prerona Chatterjee and
Mrinal Kumar and
Adrian She and
Ben Lee Volk},
editor = {Shubhangi Saraf},
title = {A Quadratic Lower Bound for Algebraic Branching Programs},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {2:1--2:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.2},
doi = {10.4230/LIPICS.CCC.2020.2},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Chatterjee0SV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChattopadhyayL20,
author = {Eshan Chattopadhyay and
Jyun{-}Jie Liao},
editor = {Shubhangi Saraf},
title = {Optimal Error Pseudodistributions for Read-Once Branching Programs},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {25:1--25:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.25},
doi = {10.4230/LIPICS.CCC.2020.25},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChattopadhyayL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChauguleKLMS020,
author = {Prasad Chaugule and
Mrinal Kumar and
Nutan Limaye and
Chandra Kanta Mohapatra and
Adrian She and
Srikanth Srinivasan},
editor = {Shubhangi Saraf},
title = {Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {14:1--14:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.14},
doi = {10.4230/LIPICS.CCC.2020.14},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ChauguleKLMS020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChengH20,
author = {Kuan Cheng and
William M. Hoza},
editor = {Shubhangi Saraf},
title = {Hitting Sets Give Two-Sided Derandomization of Small Space},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {10:1--10:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.10},
doi = {10.4230/LIPICS.CCC.2020.10},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChengH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CohenS20,
author = {Gil Cohen and
Shahar Samocha},
editor = {Shubhangi Saraf},
title = {Palette-Alternating Tree Codes},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {11:1--11:29},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.11},
doi = {10.4230/LIPICS.CCC.2020.11},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CohenS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CoulsonDKPR20,
author = {Matthew Coulson and
Ewan Davies and
Alexandra Kolla and
Viresh Patel and
Guus Regts},
editor = {Shubhangi Saraf},
title = {Statistical Physics Approaches to Unique Games},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {13:1--13:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.13},
doi = {10.4230/LIPICS.CCC.2020.13},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CoulsonDKPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DadushT20,
author = {Daniel Dadush and
Samarth Tiwari},
editor = {Shubhangi Saraf},
title = {On the Complexity of Branching Proofs},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {34:1--34:35},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.34},
doi = {10.4230/LIPICS.CCC.2020.34},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DadushT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DarkK20,
author = {Jacques Dark and
Christian Konrad},
editor = {Shubhangi Saraf},
title = {Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph
Streams},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {30:1--30:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.30},
doi = {10.4230/LIPICS.CCC.2020.30},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DarkK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DoronHH20,
author = {Dean Doron and
Pooya Hatami and
William M. Hoza},
editor = {Shubhangi Saraf},
title = {Log-Seed Pseudorandom Generators via Iterated Restrictions},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {6:1--6:36},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.6},
doi = {10.4230/LIPICS.CCC.2020.6},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DoronHH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FilmusIKK20,
author = {Yuval Filmus and
Yuval Ishai and
Avi Kaplan and
Guy Kindler},
editor = {Shubhangi Saraf},
title = {Limits of Preprocessing},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {17:1--17:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.17},
doi = {10.4230/LIPICS.CCC.2020.17},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FilmusIKK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GargIMOWW20,
author = {Ankit Garg and
Christian Ikenmeyer and
Visu Makam and
Rafael Mendes de Oliveira and
Michael Walter and
Avi Wigderson},
editor = {Shubhangi Saraf},
title = {Search Problems in Algebraic Complexity, GCT, and Hardness of Generators
for Invariant Rings},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {12:1--12:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.12},
doi = {10.4230/LIPICS.CCC.2020.12},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GargIMOWW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoosKSZ20,
author = {Mika G{\"{o}}{\"{o}}s and
Pritish Kamath and
Katerina Sotiraki and
Manolis Zampetakis},
editor = {Shubhangi Saraf},
title = {On the Complexity of Modulo-q Arguments and the Chevalley - Warning
Theorem},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {19:1--19:42},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.19},
doi = {10.4230/LIPICS.CCC.2020.19},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GoosKSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Gupta0T20,
author = {Nikhil Gupta and
Chandan Saha and
Bhargav Thankey},
editor = {Shubhangi Saraf},
title = {A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {23:1--23:31},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.23},
doi = {10.4230/LIPICS.CCC.2020.23},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Gupta0T20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HatamiHL20,
author = {Hamed Hatami and
Kaave Hosseini and
Shachar Lovett},
editor = {Shubhangi Saraf},
title = {Sign Rank vs Discrepancy},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {18:1--18:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.18},
doi = {10.4230/LIPICS.CCC.2020.18},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/HatamiHL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hirahara20,
author = {Shuichi Hirahara},
editor = {Shubhangi Saraf},
title = {Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom
Generator Constructions},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {20:1--20:47},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.20},
doi = {10.4230/LIPICS.CCC.2020.20},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Hirahara20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ilango20,
author = {Rahul Ilango},
editor = {Shubhangi Saraf},
title = {Connecting Perebor Conjectures: Towards a Search to Decision Reduction
for Minimizing Formulas},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {31:1--31:35},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.31},
doi = {10.4230/LIPICS.CCC.2020.31},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ilango20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/IlangoLO20,
author = {Rahul Ilango and
Bruno Loff and
Igor C. Oliveira},
editor = {Shubhangi Saraf},
title = {NP-Hardness of Circuit Minimization for Multi-Output Functions},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {22:1--22:36},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.22},
doi = {10.4230/LIPICS.CCC.2020.22},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/IlangoLO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KabanetsKLMO20,
author = {Valentine Kabanets and
Sajin Koroth and
Zhenjian Lu and
Dimitrios Myrisiotis and
Igor C. Oliveira},
editor = {Shubhangi Saraf},
title = {Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication
Leaf Gates},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {15:1--15:41},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.15},
doi = {10.4230/LIPICS.CCC.2020.15},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KabanetsKLMO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KoppartyMZ20,
author = {Swastik Kopparty and
Guy Moshkovitz and
Jeroen Zuiddam},
editor = {Shubhangi Saraf},
title = {Geometric Rank of Tensors and Subrank of Matrix Multiplication},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {35:1--35:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.35},
doi = {10.4230/LIPICS.CCC.2020.35},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KoppartyMZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KozachinskiyP20,
author = {Alexander Kozachinskiy and
Vladimir V. Podolskii},
editor = {Shubhangi Saraf},
title = {Multiparty Karchmer - Wigderson Games and Threshold Circuits},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {24:1--24:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.24},
doi = {10.4230/LIPICS.CCC.2020.24},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KozachinskiyP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KunnemannM20,
author = {Marvin K{\"{u}}nnemann and
D{\'{a}}niel Marx},
editor = {Shubhangi Saraf},
title = {Finding Small Satisfying Assignments Faster Than Brute Force: {A}
Fine-Grained Perspective into Boolean Constraint Satisfaction},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {27:1--27:28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.27},
doi = {10.4230/LIPICS.CCC.2020.27},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KunnemannM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/PelegS20,
author = {Shir Peleg and
Amir Shpilka},
editor = {Shubhangi Saraf},
title = {A Generalized Sylvester-Gallai Type Theorem for Quadratic Polynomials},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {8:1--8:33},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.8},
doi = {10.4230/LIPICS.CCC.2020.8},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/PelegS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Potechin20,
author = {Aaron Potechin},
editor = {Shubhangi Saraf},
title = {Sum of Squares Bounds for the Ordering Principle},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {38:1--38:37},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.38},
doi = {10.4230/LIPICS.CCC.2020.38},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Potechin20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/RezendeNR020,
author = {Susanna F. de Rezende and
Jakob Nordstr{\"{o}}m and
Kilian Risse and
Dmitry Sokolov},
editor = {Shubhangi Saraf},
title = {Exponential Resolution Lower Bounds for Weak Pigeonhole Principle
and Perfect Matching Formulas over Sparse Graphs},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {28:1--28:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.28},
doi = {10.4230/LIPICS.CCC.2020.28},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/RezendeNR020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SaksS20,
author = {Michael E. Saks and
Rahul Santhanam},
editor = {Shubhangi Saraf},
title = {Circuit Lower Bounds from NP-Hardness of {MCSP} Under Turing Reductions},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {26:1--26:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.26},
doi = {10.4230/LIPICS.CCC.2020.26},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SaksS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SchederT20,
author = {Dominik Scheder and
Navid Talebanfard},
editor = {Shubhangi Saraf},
title = {Super Strong {ETH} Is True for {PPSZ} with Small Resolution Width},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {3:1--3:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.3},
doi = {10.4230/LIPICS.CCC.2020.3},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SchederT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SinhababuT20,
author = {Amit Sinhababu and
Thomas Thierauf},
editor = {Shubhangi Saraf},
title = {Factorization of Polynomials Given By Arithmetic Branching Programs},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {33:1--33:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.33},
doi = {10.4230/LIPICS.CCC.2020.33},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SinhababuT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/X20,
editor = {Shubhangi Saraf},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {0:1--0:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.0},
doi = {10.4230/LIPICS.CCC.2020.0},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/X20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2020,
editor = {Shubhangi Saraf},
title = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-156-6},
isbn = {978-3-95977-156-6},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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 = {Thu, 02 Feb 2023 00:00:00 +0100},
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 = {Thu, 02 Feb 2023 00:00:00 +0100},
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}
}
@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 = {Tue, 07 May 2024 01:00:00 +0200},
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 = {Tue, 07 May 2024 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 = {Tue, 07 May 2024 01:00:00 +0200},
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 = {Tue, 07 May 2024 01:00:00 +0200},
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}
}
@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}
}
@inproceedings{DBLP:conf/coco/0001S16,
author = {Mrinal Kumar and
Shubhangi Saraf},
editor = {Ran Raz},
title = {Arithmetic Circuits with Locally Low Algebraic Rank},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {34:1--34:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.34},
doi = {10.4230/LIPICS.CCC.2016.34},
timestamp = {Thu, 02 Feb 2023 13:27:05 +0100},
biburl = {https://dblp.org/rec/conf/coco/0001S16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001S16a,
author = {Mrinal Kumar and
Shubhangi Saraf},
editor = {Ran Raz},
title = {Sums of Products of Polynomials in Few Variables: Lower Bounds and
Polynomial Identity Testing},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {35:1--35:29},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.35},
doi = {10.4230/LIPICS.CCC.2016.35},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/0001S16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AaronsonAIKS16,
author = {Scott Aaronson and
Andris Ambainis and
Janis Iraids and
Martins Kokainis and
Juris Smotrovs},
editor = {Ran Raz},
title = {Polynomials, Quantum Query Complexity, and Grothendieck's Inequality},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {25:1--25:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.25},
doi = {10.4230/LIPICS.CCC.2016.25},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AaronsonAIKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AaronsonB16,
author = {Scott Aaronson and
Shalev Ben{-}David},
editor = {Ran Raz},
title = {Sculpting Quantum Speedups},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {26:1--26:28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.26},
doi = {10.4230/LIPICS.CCC.2016.26},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AaronsonB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AiHLW16,
author = {Yuqing Ai and
Wei Hu and
Yi Li and
David P. Woodruff},
editor = {Ran Raz},
title = {New Characterizations in Turnstile Streams with Applications},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {20:1--20:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.20},
doi = {10.4230/LIPICS.CCC.2016.20},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AiHLW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmbainisKK16,
author = {Andris Ambainis and
Martins Kokainis and
Robin Kothari},
editor = {Ran Raz},
title = {Nearly Optimal Separations Between Communication (or Query) Complexity
and Partitions},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {4:1--4:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.4},
doi = {10.4230/LIPICS.CCC.2016.4},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AmbainisKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AndersonFSSV16,
author = {Matthew Anderson and
Michael A. Forbes and
Ramprasad Saptharishi and
Amir Shpilka and
Ben Lee Volk},
editor = {Ran Raz},
title = {Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching
Programs},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {30:1--30:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.30},
doi = {10.4230/LIPICS.CCC.2016.30},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AndersonFSSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ArtemenkoIKS16,
author = {Sergei Artemenko and
Russell Impagliazzo and
Valentine Kabanets and
Ronen Shaltiel},
editor = {Ran Raz},
title = {Pseudorandomness When the Odds are Against You},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {9:1--9:35},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.9},
doi = {10.4230/LIPICS.CCC.2016.9},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ArtemenkoIKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeaudrapG16,
author = {J. Niel de Beaudrap and
Sevag Gharibian},
editor = {Ran Raz},
title = {A Linear Time Algorithm for Quantum 2-SAT},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {27:1--27:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.27},
doi = {10.4230/LIPICS.CCC.2016.27},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeaudrapG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BhattacharyyaG16,
author = {Arnab Bhattacharyya and
Sivakanth Gopi},
editor = {Ran Raz},
title = {Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {12:1--12:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.12},
doi = {10.4230/LIPICS.CCC.2016.12},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BhattacharyyaG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BoulandMZ16,
author = {Adam Bouland and
Laura Mancinska and
Xue Zhang},
editor = {Ran Raz},
title = {Complexity Classification of Two-Qubit Commuting Hamiltonians},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {28:1--28:33},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.28},
doi = {10.4230/LIPICS.CCC.2016.28},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BoulandMZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BrakensiekG16,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
editor = {Ran Raz},
title = {New Hardness Results for Graph and Hypergraph Colorings},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {14:1--14:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.14},
doi = {10.4230/LIPICS.CCC.2016.14},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BrakensiekG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CarmosinoIKK16,
author = {Marco L. Carmosino and
Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova},
editor = {Ran Raz},
title = {Learning Algorithms from Natural Proofs},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {10:1--10:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.10},
doi = {10.4230/LIPICS.CCC.2016.10},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CarmosinoIKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChattopadhyayZ16,
author = {Eshan Chattopadhyay and
David Zuckerman},
editor = {Ran Raz},
title = {New Extractors for Interleaved Sources},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {7:1--7:28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.7},
doi = {10.4230/LIPICS.CCC.2016.7},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChattopadhyayZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChenSS16,
author = {Ruiwen Chen and
Rahul Santhanam and
Srikanth Srinivasan},
editor = {Ran Raz},
title = {Average-Case Lower Bounds and Satisfiability Algorithms for Small
Threshold Circuits},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {1:1--1:35},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.1},
doi = {10.4230/LIPICS.CCC.2016.1},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChenSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Cohen16,
author = {Gil Cohen},
editor = {Ran Raz},
title = {Non-Malleable Extractors - New Tools and Improved Constructions},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {8:1--8:29},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.8},
doi = {10.4230/LIPICS.CCC.2016.8},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Cohen16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DengEFLQX16,
author = {Xiaotie Deng and
Jack R. Edmonds and
Zhe Feng and
Zhengyang Liu and
Qi Qi and
Zeying Xu},
editor = {Ran Raz},
title = {Understanding PPA-Completeness},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {23:1--23:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.23},
doi = {10.4230/LIPICS.CCC.2016.23},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DengEFLQX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DinurM16,
author = {Irit Dinur and
Or Meir},
editor = {Ran Raz},
title = {Toward the {KRW} Composition Conjecture: Cubic Formula Lower Bounds
via Communication Complexity},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {3:1--3:51},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.3},
doi = {10.4230/LIPICS.CCC.2016.3},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DinurM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FilmusKMW16,
author = {Yuval Filmus and
Guy Kindler and
Elchanan Mossel and
Karl Wimmer},
editor = {Ran Raz},
title = {Invariance Principle on the Slice},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {15:1--15:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.15},
doi = {10.4230/LIPICS.CCC.2016.15},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FilmusKMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FilmusM16,
author = {Yuval Filmus and
Elchanan Mossel},
editor = {Ran Raz},
title = {Harmonicity and Invariance on Slices of the Boolean Cube},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {16:1--16:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.16},
doi = {10.4230/LIPICS.CCC.2016.16},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FilmusM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ForbesKS16,
author = {Michael A. Forbes and
Mrinal Kumar and
Ramprasad Saptharishi},
editor = {Ran Raz},
title = {Functional Lower Bounds for Arithmetic Circuits and Connections to
Boolean Circuit Complexity},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {33:1--33:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.33},
doi = {10.4230/LIPICS.CCC.2016.33},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ForbesKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ForbesSTW16,
author = {Michael A. Forbes and
Amir Shpilka and
Iddo Tzameret and
Avi Wigderson},
editor = {Ran Raz},
title = {Proof Complexity Lower Bounds from Algebraic Circuit Complexity},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {32:1--32:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.32},
doi = {10.4230/LIPICS.CCC.2016.32},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ForbesSTW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowS16,
author = {Lance Fortnow and
Rahul Santhanam},
editor = {Ran Raz},
title = {New Non-Uniform Lower Bounds for Uniform Classes},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {19:1--19:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.19},
doi = {10.4230/LIPICS.CCC.2016.19},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FortnowS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoosJ16,
author = {Mika G{\"{o}}{\"{o}}s and
T. S. Jayram},
editor = {Ran Raz},
title = {A Composition Theorem for Conical Juntas},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {5:1--5:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.5},
doi = {10.4230/LIPICS.CCC.2016.5},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoosJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GopalanSW16,
author = {Parikshit Gopalan and
Rocco A. Servedio and
Avi Wigderson},
editor = {Ran Raz},
title = {Degree and Sensitivity: Tails of Two Distributions},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {13:1--13:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.13},
doi = {10.4230/LIPICS.CCC.2016.13},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GopalanSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GurjarKS16,
author = {Rohit Gurjar and
Arpita Korwar and
Nitin Saxena},
editor = {Ran Raz},
title = {Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious
ABPs},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {29:1--29:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.29},
doi = {10.4230/LIPICS.CCC.2016.29},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GurjarKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiR16,
author = {Venkatesan Guruswami and
Jaikumar Radhakrishnan},
editor = {Ran Raz},
title = {Tight Bounds for Communication-Assisted Agreement Distillation},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {6:1--6:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.6},
doi = {10.4230/LIPICS.CCC.2016.6},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HarrowNW16,
author = {Aram W. Harrow and
Anand Natarajan and
Xiaodi Wu},
editor = {Ran Raz},
title = {Tight SoS-Degree Bounds for Approximate Nash Equilibria},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {22:1--22:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.22},
doi = {10.4230/LIPICS.CCC.2016.22},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/HarrowNW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HiraharaW16,
author = {Shuichi Hirahara and
Osamu Watanabe},
editor = {Ran Raz},
title = {Limits of Minimum Circuit Size Problem as Oracle},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {18:1--18:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.18},
doi = {10.4230/LIPICS.CCC.2016.18},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HiraharaW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KimK16,
author = {John Y. Kim and
Swastik Kopparty},
editor = {Ran Raz},
title = {Decoding Reed-Muller Codes Over Product Sets},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {11:1--11:28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.11},
doi = {10.4230/LIPICS.CCC.2016.11},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KimK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeePWY16,
author = {Troy Lee and
Anupam Prakash and
Ronald de Wolf and
Henry Yuen},
editor = {Ran Raz},
title = {On the Sum-of-Squares Degree of Symmetric Quadratic Functions},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {17:1--17:31},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.17},
doi = {10.4230/LIPICS.CCC.2016.17},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LeePWY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ODonnellZ16,
author = {Ryan O'Donnell and
Yu Zhao},
editor = {Ran Raz},
title = {Polynomial Bounds for Decoupling, with Applications},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {24:1--24:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.24},
doi = {10.4230/LIPICS.CCC.2016.24},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ODonnellZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Sinha16,
author = {Gaurav Sinha},
editor = {Ran Raz},
title = {Reconstruction of Real Depth-3 Circuits with Top Fan-In 2},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {31:1--31:53},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.31},
doi = {10.4230/LIPICS.CCC.2016.31},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Sinha16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Vishnoi16,
author = {Nisheeth K. Vishnoi},
editor = {Ran Raz},
title = {Evolution and Computation (Invited Talk)},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {21:1--21:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.21},
doi = {10.4230/LIPICS.CCC.2016.21},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Vishnoi16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Williams16,
author = {Richard Ryan Williams},
editor = {Ran Raz},
title = {Strong {ETH} Breaks With Merlin and Arthur: Short Non-Interactive
Proofs of Batch Evaluation},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {2:1--2:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.2},
doi = {10.4230/LIPICS.CCC.2016.2},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Williams16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/X16,
editor = {Ran Raz},
title = {Front Matter, Table of Contents, Preface, Awards, Conference Organization,
External Reviewers},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {0:i--0:xvi},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.0},
doi = {10.4230/LIPICS.CCC.2016.0},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/X16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2016,
editor = {Ran Raz},
title = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-008-8},
isbn = {978-3-95977-008-8},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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, 02 Feb 2023 00:00:00 +0100},
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 = {Thu, 02 Feb 2023 00:00:00 +0100},
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}
}
@inproceedings{DBLP:conf/coco/0001GMRY14,
author = {Andreas G{\"{o}}bel and
Leslie Ann Goldberg and
Colin McQuillan and
David Richerby and
Tomoyuki Yamakami},
title = {Counting List Matrix Partitions of Graphs},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {56--65},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.14},
doi = {10.1109/CCC.2014.14},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/0001GMRY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AaronsonIM14,
author = {Scott Aaronson and
Russell Impagliazzo and
Dana Moshkovitz},
title = {{AM} with Multiple Merlins},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {44--55},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.13},
doi = {10.1109/CCC.2014.13},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AaronsonIM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ambainis14,
author = {Andris Ambainis},
title = {On Physical Problems that are Slightly More Difficult than {QMA}},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {32--43},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.12},
doi = {10.1109/CCC.2014.12},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ambainis14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AtseriasLN14,
author = {Albert Atserias and
Massimo Lauria and
Jakob Nordstr{\"{o}}m},
title = {Narrow Proofs May Be Maximally Long},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {286--297},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.36},
doi = {10.1109/CCC.2014.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AtseriasLN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BackursB14,
author = {Arturs Backurs and
Mohammad Bavarian},
title = {On the Sum of {L1} Influences},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {132--143},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.21},
doi = {10.1109/CCC.2014.21},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BackursB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BauwensZ14,
author = {Bruno Bauwens and
Marius Zimand},
title = {Linear List-Approximation for Short Programs (or the Power of a Few
Random Bits)},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {241--247},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.32},
doi = {10.1109/CCC.2014.32},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BauwensZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Belovs14,
author = {Aleksandrs Belovs},
title = {Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {22--31},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.11},
doi = {10.1109/CCC.2014.11},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Belovs14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaisRY14,
author = {Eric Blais and
Sofya Raskhodnikova and
Grigory Yaroslavtsev},
title = {Lower Bounds for Testing Properties of Functions over Hypergrid Domains},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {309--320},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.38},
doi = {10.1109/CCC.2014.38},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaisRY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChenKKSZ14,
author = {Ruiwen Chen and
Valentine Kabanets and
Antonina Kolokolova and
Ronen Shaltiel and
David Zuckerman},
title = {Mining Circuit Lower Bound Proofs for Meta-algorithms},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {262--273},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.34},
doi = {10.1109/CCC.2014.34},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChenKKSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DadushRS14,
author = {Daniel Dadush and
Oded Regev and
Noah Stephens{-}Davidowitz},
title = {On the Closest Vector Problem with a Distance Guarantee},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {98--109},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.18},
doi = {10.1109/CCC.2014.18},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DadushRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DeDS14,
author = {Anindya De and
Ilias Diakonikolas and
Rocco A. Servedio},
title = {Deterministic Approximate Counting for Juntas of Degree-2 Polynomial
Threshold Functions},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {229--240},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.31},
doi = {10.1109/CCC.2014.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DeDS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DinurS14,
author = {Irit Dinur and
David Steurer},
title = {Direct Product Testing},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {188--196},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.27},
doi = {10.1109/CCC.2014.27},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DinurS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DinurSV14,
author = {Irit Dinur and
David Steurer and
Thomas Vidick},
title = {A Parallel Repetition Theorem for Entangled Projection Games},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {197--208},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.28},
doi = {10.1109/CCC.2014.28},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DinurSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Gentry14,
author = {Craig Gentry},
title = {Noncommutative Determinant is Hard: {A} Simple Proof Using an Extension
of Barrington's Theorem},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {181--187},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.26},
doi = {10.1109/CCC.2014.26},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Gentry14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Grochow14,
author = {Joshua A. Grochow},
title = {Unifying Known Lower Bounds via Geometric Complexity Theory},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {274--285},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.35},
doi = {10.1109/CCC.2014.35},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Grochow14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GrochowQ14,
author = {Joshua A. Grochow and
Youming Qiao},
title = {Algorithms for Group Isomorphism via Group Extensions and Cohomology},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {110--119},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.19},
doi = {10.1109/CCC.2014.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GrochowQ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiX14,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Hitting Sets for Low-Degree Polynomials with Optimal Density},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {161--168},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.24},
doi = {10.1109/CCC.2014.24},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoK14,
author = {Russell Impagliazzo and
Valentine Kabanets},
title = {Fourier Concentration from Shrinkage},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {321--332},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.39},
doi = {10.1109/CCC.2014.39},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/JainPY14,
author = {Rahul Jain and
Attila Pereszl{\'{e}}nyi and
Penghui Yao},
title = {A Parallel Repetition Theorem for Entangled Two-Player One-Round Games
under Product Distributions},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {209--216},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.29},
doi = {10.1109/CCC.2014.29},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/JainPY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Kane14,
author = {Daniel M. Kane},
title = {A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian
with Subpolynomial Seed Length},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {217--228},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.30},
doi = {10.1109/CCC.2014.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Kane14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KoppartySS14,
author = {Swastik Kopparty and
Shubhangi Saraf and
Amir Shpilka},
title = {Equivalence of Polynomial Identity Testing and Deterministic Multivariate
Polynomial Factorization},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {169--180},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.25},
doi = {10.1109/CCC.2014.25},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KoppartySS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeRST14,
author = {James R. Lee and
Prasad Raghavendra and
David Steurer and
Ning Tan},
title = {On the Power of Symmetric {LP} and {SDP} Relaxations},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {13--21},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.10},
doi = {10.1109/CCC.2014.10},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LeeRST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Micciancio14,
author = {Daniele Micciancio},
title = {Locally Dense Codes},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {90--97},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.17},
doi = {10.1109/CCC.2014.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Micciancio14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ODonnellW14,
author = {Ryan O'Donnell and
David Witmer},
title = {Goldreich's {PRG:} Evidence for Near-Optimal Polynomial Stretch},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {1--12},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.9},
doi = {10.1109/CCC.2014.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ODonnellW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ODonnellWZST14,
author = {Ryan O'Donnell and
John Wright and
Yu Zhao and
Xiaorui Sun and
Li{-}Yang Tan},
title = {A Composition Theorem for Parity Kill Number},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {144--154},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.22},
doi = {10.1109/CCC.2014.22},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ODonnellWZST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/PapakonstantinouSS14,
author = {Periklis A. Papakonstantinou and
Dominik Scheder and
Hao Song},
title = {Overlays and Limited Memory Communication},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {298--308},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.37},
doi = {10.1109/CCC.2014.37},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/PapakonstantinouSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Saket14,
author = {Rishi Saket},
title = {Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and
of Satisfiable CSPs},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {78--89},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.16},
doi = {10.1109/CCC.2014.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Saket14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Saraf14,
author = {Shubhangi Saraf},
title = {Recent Progress on Lower Bounds for Arithmetic Circuits},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {155--160},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.23},
doi = {10.1109/CCC.2014.23},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Saraf14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/StraubTW14,
author = {Simon Straub and
Thomas Thierauf and
Fabian Wagner},
title = {Counting the Number of Perfect Matchings in K5-Free Graphs},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {66--77},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.15},
doi = {10.1109/CCC.2014.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/StraubTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Williams14,
author = {Ryan Williams},
title = {Algorithms for Circuits and Circuits for Algorithms},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {248--261},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.33},
doi = {10.1109/CCC.2014.33},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Williams14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Wimmer14,
author = {Karl Wimmer},
title = {Low Influence Functions over Slices of the Boolean Hypercube Depend
on Few Coordinates},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {120--131},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.20},
doi = {10.1109/CCC.2014.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Wimmer14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2014,
title = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://ieeexplore.ieee.org/xpl/conhome/6875457/proceeding},
isbn = {978-1-4799-3626-7},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001KKS13,
author = {Ankit Gupta and
Pritish Kamath and
Neeraj Kayal and
Ramprasad Saptharishi},
title = {Approaching the Chasm at Depth Four},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {65--73},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.16},
doi = {10.1109/CCC.2013.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/0001KKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001KQ13,
author = {Ankit Gupta and
Neeraj Kayal and
Youming Qiao},
title = {Random Arithmetic Formulas Can Be Reconstructed Efficiently},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {1--9},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.10},
doi = {10.1109/CCC.2013.10},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/0001KQ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AlonC13,
author = {Noga Alon and
Gil Cohen},
title = {On Rigid Matrices and U-polynomials},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {197--206},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.28},
doi = {10.1109/CCC.2013.28},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AlonC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmbainisW13,
author = {Andris Ambainis and
Ronald de Wolf},
title = {How Low Can Approximate Degree and Quantum Query Complexity Be for
Total Boolean Functions?},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {179--184},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.26},
doi = {10.1109/CCC.2013.26},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AmbainisW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AtseriasMO13,
author = {Albert Atserias and
Moritz M{\"{u}}ller and
Sergi Oliva},
title = {Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole
Principle},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {109--120},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.20},
doi = {10.1109/CCC.2013.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AtseriasMO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BauwensMVZ13,
author = {Bruno Bauwens and
Anton Makhlin and
Nikolay K. Vereshchagin and
Marius Zimand},
title = {Short Lists with Short Programs in Short Time},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {98--108},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.19},
doi = {10.1109/CCC.2013.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BauwensMVZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BelovsR13,
author = {Aleksandrs Belovs and
Ansis Rosmanis},
title = {On the Power of Non-adaptive Learning Graphs},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {44--55},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.14},
doi = {10.1109/CCC.2013.14},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BelovsR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaisT13,
author = {Eric Blais and
Li{-}Yang Tan},
title = {Approximating Boolean Functions with Depth-2 Circuits},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {74--85},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.17},
doi = {10.1109/CCC.2013.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaisT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BrodyBKLSV13,
author = {Joshua Brody and
Harry Buhrman and
Michal Kouck{\'{y}} and
Bruno Loff and
Florian Speelman and
Nikolay K. Vereshchagin},
title = {Towards a Reverse Newman's Theorem in Interactive Information Complexity},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {24--33},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.12},
doi = {10.1109/CCC.2013.12},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BrodyBKLSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Chan13,
author = {Siu Man Chan},
title = {Just a Pebble Game},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {133--143},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.22},
doi = {10.1109/CCC.2013.22},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Chan13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChungDLP13,
author = {Kai{-}Min Chung and
Daniel Dadush and
Feng{-}Hao Liu and
Chris Peikert},
title = {On the Lattice Smoothing Parameter Problem},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {230--241},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.31},
doi = {10.1109/CCC.2013.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChungDLP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DinurK13,
author = {Irit Dinur and
Gillat Kol},
title = {Covering CSPs},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {207--218},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.29},
doi = {10.1109/CCC.2013.29},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DinurK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GavinskyIW13,
author = {Dmitry Gavinsky and
Tsuyoshi Ito and
Guoming Wang},
title = {Shared Randomness and Quantum Communication in the Multi-party Model},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {34--43},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.13},
doi = {10.1109/CCC.2013.13},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GavinskyIW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GilmerSS13,
author = {Justin Gilmer and
Michael E. Saks and
Srikanth Srinivasan},
title = {Composition Limits and Separating Examples for Some Boolean Function
Complexity Measures},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {185--196},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.27},
doi = {10.1109/CCC.2013.27},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GilmerSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiO13,
author = {Venkatesan Guruswami and
Krzysztof Onak},
title = {Superlinear Lower Bounds for Multipass Graph Processing},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {287--298},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.37},
doi = {10.1109/CCC.2013.37},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HartungN13,
author = {Sepp Hartung and
Andr{\'{e}} Nichterlein},
title = {On the Parameterized and Approximation Hardness of Metric Dimension},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {266--276},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.36},
doi = {10.1109/CCC.2013.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HartungN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HaydenMW13,
author = {Patrick M. Hayden and
Kevin Milner and
Mark M. Wilde},
title = {Two-Message Quantum Interactive Proofs and the Quantum Separability
Problem},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {156--167},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.24},
doi = {10.1109/CCC.2013.24},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HaydenMW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HrubesY13,
author = {Pavel Hrubes and
Amir Yehudayoff},
title = {Formulas are Exponentially Stronger than Monotone Circuits in Non-commutative
Setting},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {10--14},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.11},
doi = {10.1109/CCC.2013.11},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HrubesY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImaiNPVW13,
author = {Tatsuya Imai and
Kotaro Nakagawa and
Aduri Pavan and
N. V. Vinodchandran and
Osamu Watanabe},
title = {An O(n{\textonehalf}+{\(\sum\)})-Space and Polynomial-Time Algorithm
for Directed Planar Reachability},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {277--286},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.35},
doi = {10.1109/CCC.2013.35},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ImaiNPVW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Kane13,
author = {Daniel M. Kane},
title = {The Correct Exponent for the Gotsman-Linial Conjecture},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {56--64},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.15},
doi = {10.1109/CCC.2013.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Kane13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KlivansKO13,
author = {Adam R. Klivans and
Pravesh Kothari and
Igor C. Oliveira},
title = {Constructing Hard Functions Using Learning Algorithms},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {86--97},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.18},
doi = {10.1109/CCC.2013.18},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KlivansKO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/RegevV13,
author = {Oded Regev and
Thomas Vidick},
title = {Quantum {XOR} Games},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {144--155},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.23},
doi = {10.1109/CCC.2013.23},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/RegevV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SachdevaS13,
author = {Sushant Sachdeva and
Rishi Saket},
title = {Optimal Inapproximability for Scheduling Problems via Structural Hardness
for Hypergraph Vertex Cover},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {219--229},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.30},
doi = {10.1109/CCC.2013.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SachdevaS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SanthanamW13,
author = {Rahul Santhanam and
Ryan Williams},
title = {On Medium-Uniformity and Circuit Lower Bounds},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {15--23},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.40},
doi = {10.1109/CCC.2013.40},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SanthanamW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Steinberger13,
author = {John P. Steinberger},
title = {The Distinguishability of Product Distributions by Read-Once Branching
Programs},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {248--254},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.33},
doi = {10.1109/CCC.2013.33},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Steinberger13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TakahashiT13,
author = {Yasuhiro Takahashi and
Seiichiro Tani},
title = {Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {168--178},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.25},
doi = {10.1109/CCC.2013.25},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/TakahashiT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TrevisanX13,
author = {Luca Trevisan and
Tongke Xue},
title = {A Derandomized Switching Lemma and an Improved Derandomization of
{AC0}},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {242--247},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.32},
doi = {10.1109/CCC.2013.32},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/TrevisanX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TulsianiW13,
author = {Madhur Tulsiani and
Pratik Worah},
title = {{LS+} Lower Bounds from Pairwise Independence},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {121--132},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.21},
doi = {10.1109/CCC.2013.21},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/TulsianiW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Viderman13,
author = {Michael Viderman},
title = {Strong LTCs with Inverse Polylogarithmic Rate and Soundness},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {255--265},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.34},
doi = {10.1109/CCC.2013.34},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Viderman13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2013,
title = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://ieeexplore.ieee.org/xpl/conhome/6596469/proceeding},
isbn = {978-0-7695-4997-2},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AdaCCFKP12,
author = {Anil Ada and
Arkadev Chattopadhyay and
Stephen A. Cook and
Lila Fontes and
Michal Kouck{\'{y}} and
Toniann Pitassi},
title = {The Hardness of Being Private},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {192--202},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.24},
doi = {10.1109/CCC.2012.24},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AdaCCFKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AlonSU12,
author = {Noga Alon and
Amir Shpilka and
Christopher Umans},
title = {On Sunflowers and Matrix Multiplication},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {214--223},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.26},
doi = {10.1109/CCC.2012.26},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AlonSU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AustrinH12,
author = {Per Austrin and
Johan H{\aa}stad},
title = {On the Usefulness of Predicates},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {53--63},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.18},
doi = {10.1109/CCC.2012.18},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AustrinH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AydinliogluM12,
author = {Baris Aydinlioglu and
Dieter van Melkebeek},
title = {Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin
Games},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {269--279},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.32},
doi = {10.1109/CCC.2012.32},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AydinliogluM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeameIS12,
author = {Paul Beame and
Russell Impagliazzo and
Srikanth Srinivasan},
title = {Approximating {AC0} by Small Height Decision Trees and a Deterministic
Algorithm for {\#}AC0SAT},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {117--125},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.40},
doi = {10.1109/CCC.2012.40},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BeameIS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeimelIKO12,
author = {Amos Beimel and
Yuval Ishai and
Eyal Kushilevitz and
Ilan Orlov},
title = {Share Conversion and Private Information Retrieval},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {258--268},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.23},
doi = {10.1109/CCC.2012.23},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeimelIKO12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaserC12,
author = {Markus Bl{\"{a}}ser and
Bekhan Chokaev},
title = {Algebras of Minimal Multiplicative Complexity},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {224--234},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.13},
doi = {10.1109/CCC.2012.13},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaserC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Burgisser12,
author = {Peter B{\"{u}}rgisser},
title = {Prospects for Geometric Complexity Theory},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {235},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.19},
doi = {10.1109/CCC.2012.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Burgisser12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BussW12,
author = {Samuel R. Buss and
Ryan Williams},
title = {Limits on Alternation-Trading Proofs for Time-Space Lower Bounds},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {181--191},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.30},
doi = {10.1109/CCC.2012.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BussW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChaillouxS12,
author = {Andr{\'{e}} Chailloux and
Or Sattath},
title = {The Complexity of the Separable Hamiltonian Problem},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {32--41},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.42},
doi = {10.1109/CCC.2012.42},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChaillouxS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChakrabortyFGM12,
author = {Sourav Chakraborty and
Eldar Fischer and
David Garc{\'{\i}}a{-}Soriano and
Arie Matsliah},
title = {Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {148--158},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.28},
doi = {10.1109/CCC.2012.28},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChakrabortyFGM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CohenRS12,
author = {Gil Cohen and
Ran Raz and
Gil Segev},
title = {Non-malleable Extractors with Short Seeds and Applications to Privacy
Amplification},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {298--308},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.21},
doi = {10.1109/CCC.2012.21},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CohenRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CyganDLMNOPSW12,
author = {Marek Cygan and
Holger Dell and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Jesper Nederlof and
Yoshio Okamoto and
Ramamohan Paturi and
Saket Saurabh and
Magnus Wahlstr{\"{o}}m},
title = {On Problems as Hard as {CNF-SAT}},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {74--84},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.36},
doi = {10.1109/CCC.2012.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CyganDLMNOPSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DellKMW12,
author = {Holger Dell and
Valentine Kabanets and
Dieter van Melkebeek and
Osamu Watanabe},
title = {Is Valiant-Vazirani's Isolation Probability Improvable?},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {10--20},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.22},
doi = {10.1109/CCC.2012.22},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DellKMW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Drucker12,
author = {Andrew Drucker},
title = {Limitations of Lower-Bound Methods for the Wire Complexity of Boolean
Operators},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {170--180},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.39},
doi = {10.1109/CCC.2012.39},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Drucker12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FilmusLNTR12,
author = {Yuval Filmus and
Massimo Lauria and
Jakob Nordstr{\"{o}}m and
Neil Thapen and
Noga Ron{-}Zewi},
title = {Space Complexity in Polynomial Calculus},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {334--344},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.27},
doi = {10.1109/CCC.2012.27},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FilmusLNTR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Gavinsky12,
author = {Dmitry Gavinsky},
title = {Quantum Money with Classical Verification},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {42--52},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.10},
doi = {10.1109/CCC.2012.10},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Gavinsky12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GavinskyLS12,
author = {Dmitry Gavinsky and
Shachar Lovett and
Srikanth Srinivasan},
title = {Pseudorandom Generators for Read-Once {ACC0}},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {287--297},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.37},
doi = {10.1109/CCC.2012.37},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GavinskyLS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GopalanMR12,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold},
title = {{DNF} Sparsification and a Faster Deterministic Counting Algorithm},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {126--135},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.38},
doi = {10.1109/CCC.2012.38},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GopalanMR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GrigorescuP12,
author = {Elena Grigorescu and
Chris Peikert},
title = {List Decoding Barnes-Wall Lattices},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {316--325},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.33},
doi = {10.1109/CCC.2012.33},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GrigorescuP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Grochow12,
author = {Joshua A. Grochow},
title = {Matrix Isomorphism of Matrix Lie Algebras},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {203--213},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.34},
doi = {10.1109/CCC.2012.34},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Grochow12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GutoskiW12,
author = {Gus Gutoski and
Xiaodi Wu},
title = {Parallel Approximation of Min-max Problems with Applications to Classical
and Quantum Zero-Sum Games},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {21--31},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.12},
doi = {10.1109/CCC.2012.12},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GutoskiW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HuangL12,
author = {Sangxia Huang and
Pinyan Lu},
title = {A Dichotomy for Real Weighted Holant Problems},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {96--106},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.16},
doi = {10.1109/CCC.2012.16},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/HuangL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KindlerO12,
author = {Guy Kindler and
Ryan O'Donnell},
title = {Gaussian Noise Sensitivity and Fourier Tails},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {137--147},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.35},
doi = {10.1109/CCC.2012.35},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KindlerO12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeR12,
author = {Troy Lee and
J{\'{e}}r{\'{e}}mie Roland},
title = {A Strong Direct Product Theorem for Quantum Query Complexity},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {236--246},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.17},
doi = {10.1109/CCC.2012.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LeeR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LiptonW12,
author = {Richard J. Lipton and
Ryan Williams},
title = {Amplifying Circuit Lower Bounds against Polynomial Time with Applications},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {1--9},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.44},
doi = {10.1109/CCC.2012.44},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LiptonW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Lu12,
author = {Chi{-}Jen Lu},
title = {Hitting Set Generators for Sparse Polynomials over Any Finite Fields},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {280--286},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.20},
doi = {10.1109/CCC.2012.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Lu12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Meir12,
author = {Or Meir},
title = {Combinatorial PCPs with Short Proofs},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {345--355},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.14},
doi = {10.1109/CCC.2012.14},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Meir12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Moshkovitz12,
author = {Guy Moshkovitz},
title = {Complexity Lower Bounds through Balanced Graph Properties},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {159--169},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.31},
doi = {10.1109/CCC.2012.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Moshkovitz12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Pitassi12,
author = {Toniann Pitassi},
title = {Communication Complexity and Information Complexity: Foundations and
New Directions},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {136},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.41},
doi = {10.1109/CCC.2012.41},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Pitassi12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/RaghavendraST12,
author = {Prasad Raghavendra and
David Steurer and
Madhur Tulsiani},
title = {Reductions between Expansion Problems},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {64--73},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.43},
doi = {10.1109/CCC.2012.43},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/RaghavendraST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/RazR12,
author = {Ran Raz and
Ricky Rosen},
title = {A Strong Parallel Repetition Theorem for Projection Games on Expanders},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {247--257},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.11},
doi = {10.1109/CCC.2012.11},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/RazR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SetoT12,
author = {Kazuhisa Seto and
Suguru Tamaki},
title = {A Satisfiability Algorithm and Average-Case Hardness for Formulas
over the Full Binary Basis},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {107--116},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.29},
doi = {10.1109/CCC.2012.29},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/SetoT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/StoleeV12,
author = {Derrick Stolee and
N. V. Vinodchandran},
title = {Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {326--333},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.15},
doi = {10.1109/CCC.2012.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/StoleeV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ta-ShmaU12,
author = {Amnon Ta{-}Shma and
Christopher Umans},
title = {Better Condensers and New Extractors from Parvaresh-Vardy Codes},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {309--315},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.25},
doi = {10.1109/CCC.2012.25},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ta-ShmaU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Yoshida12,
author = {Yuichi Yoshida},
title = {Testing List H-homomorphisms},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {85--95},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.9},
doi = {10.1109/CCC.2012.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Yoshida12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2012,
title = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://ieeexplore.ieee.org/xpl/conhome/6242817/proceeding},
isbn = {978-1-4673-1663-7},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AlexeevFT11,
author = {Boris Alexeev and
Michael A. Forbes and
Jacob Tsimerman},
title = {Tensor Rank: Some Lower and Upper Bounds},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {283--291},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.28},
doi = {10.1109/CCC.2011.28},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AlexeevFT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmbainisMRR11,
author = {Andris Ambainis and
Lo{\"{\i}}ck Magnin and
Martin Roetteler and
J{\'{e}}r{\'{e}}mie Roland},
title = {Symmetry-Assisted Adversaries for Quantum State Generation},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {167--177},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.24},
doi = {10.1109/CCC.2011.24},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AmbainisMRR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AndersonMV11,
author = {Matthew Anderson and
Dieter van Melkebeek and
Ilya Volkovich},
title = {Derandomizing Polynomial Identity Testing for Multilinear Constant-Read
Formulae},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {273--282},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.18},
doi = {10.1109/CCC.2011.18},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AndersonMV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeameM11,
author = {Paul Beame and
Widad Machmouchi},
title = {Making Branching Programs Oblivious Requires Superlogarithmic Overhead},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {12--22},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.35},
doi = {10.1109/CCC.2011.35},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BeameM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-SassonMSS11,
author = {Eli Ben{-}Sasson and
Ghid Maatouk and
Amir Shpilka and
Madhu Sudan},
title = {Symmetric {LDPC} Codes are not Necessarily Locally Testable},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {55--65},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.14},
doi = {10.1109/CCC.2011.14},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Ben-SassonMSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-SassonV11,
author = {Eli Ben{-}Sasson and
Michael Viderman},
title = {Towards Lower Bounds on Locally Testable Codes via Density Arguments},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {66--76},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.9},
doi = {10.1109/CCC.2011.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ben-SassonV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaisBM11,
author = {Eric Blais and
Joshua Brody and
Kevin Matulef},
title = {Property Testing Lower Bounds via Communication Complexity},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {210--220},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.31},
doi = {10.1109/CCC.2011.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaisBM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanRSW11,
author = {Harry Buhrman and
Oded Regev and
Giannicola Scarpa and
Ronald de Wolf},
title = {Near-Optimal and Explicit Bell Inequality Violations},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {157--166},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.30},
doi = {10.1109/CCC.2011.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanRSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CaiCL11,
author = {Jin{-}yi Cai and
Xi Chen and
Pinyan Lu},
title = {Non-negatively Weighted {\#}CSP: An Effective Complexity Dichotomy},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {45--54},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.32},
doi = {10.1109/CCC.2011.32},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CaiCL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CarlucciGL11,
author = {Lorenzo Carlucci and
Nicola Galesi and
Massimo Lauria},
title = {Paris-Harrington Tautologies},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {93--103},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.17},
doi = {10.1109/CCC.2011.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CarlucciGL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChattopadhyayL11,
author = {Arkadev Chattopadhyay and
Shachar Lovett},
title = {Linear Systems over Finite Abelian Groups},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {300--308},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.25},
doi = {10.1109/CCC.2011.25},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChattopadhyayL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/De11,
author = {Anindya De},
title = {Pseudorandomness for Permutation and Regular Branching Programs},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {221--231},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.23},
doi = {10.1109/CCC.2011.23},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/De11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Drucker11,
author = {Andrew Drucker},
title = {Improved Direct Product Theorems for Randomized Query Complexity},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {1--11},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.29},
doi = {10.1109/CCC.2011.29},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Drucker11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GharibianK11,
author = {Sevag Gharibian and
Julia Kempe},
title = {Approximation Algorithms for QMA-Complete Problems},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {178--188},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.15},
doi = {10.1109/CCC.2011.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GharibianK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Guruswami11,
author = {Venkatesan Guruswami},
title = {Linear-Algebraic List Decoding of Folded Reed-Solomon Codes},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {77--85},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.22},
doi = {10.1109/CCC.2011.22},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Guruswami11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Impagliazzo11,
author = {Russell Impagliazzo},
title = {Relativized Separations of Worst-Case and Average-Case Complexities
for {NP}},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {104--114},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.34},
doi = {10.1109/CCC.2011.34},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Impagliazzo11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Kane11,
author = {Daniel M. Kane},
title = {k-Independent Gaussians Fool Polynomial Threshold Functions},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {252--261},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.13},
doi = {10.1109/CCC.2011.13},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Kane11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KarninRS11,
author = {Zohar Shay Karnin and
Yuval Rabani and
Amir Shpilka},
title = {Explicit Dimension Reduction and Its Applications},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {262--272},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.20},
doi = {10.1109/CCC.2011.20},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KarninRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KayalS11,
author = {Neeraj Kayal and
Chandan Saha},
title = {On the Sum of Square Roots of Polynomials and Related Problems},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {292--299},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.19},
doi = {10.1109/CCC.2011.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KayalS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Klauck11,
author = {Hartmut Klauck},
title = {On Arthur Merlin Games in Communication Complexity},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {189--199},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.33},
doi = {10.1109/CCC.2011.33},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Klauck11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Li11,
author = {Xin Li},
title = {Improved Constructions of Three Source Extractors},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {126--136},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.26},
doi = {10.1109/CCC.2011.26},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Li11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Li11a,
author = {Xin Li},
title = {A New Approach to Affine Extractors and Dispersers},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {137--147},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.27},
doi = {10.1109/CCC.2011.27},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Li11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LovettV11,
author = {Shachar Lovett and
Emanuele Viola},
title = {Bounded-Depth Circuits Cannot Sample Good Codes},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {243--251},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.11},
doi = {10.1109/CCC.2011.11},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LovettV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ODonnellWZ11,
author = {Ryan O'Donnell and
Yi Wu and
Yuan Zhou},
title = {Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large
Cyclic Groups},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {23--33},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.37},
doi = {10.1109/CCC.2011.37},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ODonnellWZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SarafY11,
author = {Shubhangi Saraf and
Sergey Yekhanin},
title = {Noisy Interpolation of Sparse Polynomials, and Applications},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {86--92},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.38},
doi = {10.1109/CCC.2011.38},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SarafY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ShpilkaT11,
author = {Amir Shpilka and
Avishay Tal},
title = {On the Minimal Fourier Degree of Symmetric Boolean Functions},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {200--209},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.16},
doi = {10.1109/CCC.2011.16},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ShpilkaT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Watson11,
author = {Thomas Watson},
title = {Pseudorandom Generators for Combinatorial Checkerboards},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {232--242},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.12},
doi = {10.1109/CCC.2011.12},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Watson11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Williams11,
author = {Ryan Williams},
title = {Non-uniform {ACC} Circuit Lower Bounds},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {115--125},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.36},
doi = {10.1109/CCC.2011.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Williams11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Yoshida11,
author = {Yuichi Yoshida},
title = {Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {34--44},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.10},
doi = {10.1109/CCC.2011.10},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Yoshida11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Zimand11,
author = {Marius Zimand},
title = {Symmetry of Information and Bounds on Nonuniform Randomness Extraction
via Kolmogorov Extractors},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {148--156},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.21},
doi = {10.1109/CCC.2011.21},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Zimand11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2011,
title = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://ieeexplore.ieee.org/xpl/conhome/5959244/proceeding},
isbn = {978-0-7695-4411-3},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderL10,
author = {Eric Allender and
Klaus{-}J{\"{o}}rn Lange},
title = {Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary
Pushdown Automata},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {172--180},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.24},
doi = {10.1109/CCC.2010.24},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaisO10,
author = {Eric Blais and
Ryan O'Donnell},
title = {Lower Bounds for Testing Function Isomorphism},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {235--246},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.30},
doi = {10.1109/CCC.2010.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaisO10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanFKL10,
author = {Harry Buhrman and
Lance Fortnow and
Michal Kouck{\'{y}} and
Bruno Loff},
title = {Derandomizing from Random Strings},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {58--63},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.15},
doi = {10.1109/CCC.2010.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanFKL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DavidP10,
author = {Matei David and
Periklis A. Papakonstantinou},
title = {Trade-Off Lower Bounds for Stack Machines},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {163--171},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.23},
doi = {10.1109/CCC.2010.23},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DavidP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DeVosG10,
author = {Matt DeVos and
Ariel Gabizon},
title = {Simple Affine Extractors Using Dimension Expansion},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {50--57},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.14},
doi = {10.1109/CCC.2010.14},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DeVosG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DiakonikolasSTW10,
author = {Ilias Diakonikolas and
Rocco A. Servedio and
Li{-}Yang Tan and
Andrew Wan},
title = {A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial
Threshold Functions},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {211--222},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.28},
doi = {10.1109/CCC.2010.28},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DiakonikolasSTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DinurM10,
author = {Irit Dinur and
Or Meir},
title = {Derandomized Parallel Repetition of Structured PCPs},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {16--27},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.11},
doi = {10.1109/CCC.2010.11},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DinurM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Dvir10,
author = {Zeev Dvir},
title = {On Matrix Rigidity and Locally Self-Correctable Codes},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {291--298},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.35},
doi = {10.1109/CCC.2010.35},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Dvir10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GopalanOWZ10,
author = {Parikshit Gopalan and
Ryan O'Donnell and
Yi Wu and
David Zuckerman},
title = {Fooling Functions of Halfspaces under Product Distributions},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {223--234},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.29},
doi = {10.1109/CCC.2010.29},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GopalanOWZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GutfreundK10,
author = {Dan Gutfreund and
Akinori Kawachi},
title = {Derandomizing Arthur-Merlin Games and Approximate Counting Implies
Exponential-Size Lower Bounds},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {38--49},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.13},
doi = {10.1109/CCC.2010.13},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GutfreundK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HaitnerMX10,
author = {Iftach Haitner and
Mohammad Mahmoody and
David Xiao},
title = {A New Sampling Protocol and Applications to Basing Cryptographic Primitives
on the Hardness of {NP}},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {76--87},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.17},
doi = {10.1109/CCC.2010.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HaitnerMX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HansenP10,
author = {Kristoffer Arnsfelt Hansen and
Vladimir V. Podolskii},
title = {Exact Threshold Circuits},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {270--279},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.33},
doi = {10.1109/CCC.2010.33},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HansenP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hoang10,
author = {Thanh Minh Hoang},
title = {On the Matching Problem for Special Graph Classes},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {139--150},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.21},
doi = {10.1109/CCC.2010.21},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Hoang10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HrubesWY10,
author = {Pavel Hrubes and
Avi Wigderson and
Amir Yehudayoff},
title = {Relationless Completeness and Separations},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {280--290},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.34},
doi = {10.1109/CCC.2010.34},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HrubesWY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoW10,
author = {Russell Impagliazzo and
Ryan Williams},
title = {Communication Complexity with Synchronized Clocks},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {259--269},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.32},
doi = {10.1109/CCC.2010.32},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/JainK10,
author = {Rahul Jain and
Hartmut Klauck},
title = {The Partition Bound for Classical Communication Complexity and Query
Complexity},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {247--258},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.31},
doi = {10.1109/CCC.2010.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/JainK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Kane10,
author = {Daniel M. Kane},
title = {The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial
Threshold Functions},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {205--210},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.27},
doi = {10.1109/CCC.2010.27},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Kane10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KempeR10,
author = {Julia Kempe and
Oded Regev},
title = {No Strong Parallel Repetition with Entangled and Non-signaling Provers},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {7--15},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.10},
doi = {10.1109/CCC.2010.10},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KempeR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Khot10,
author = {Subhash Khot},
title = {On the Unique Games Conjecture (Invited Survey)},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {99--121},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.19},
doi = {10.1109/CCC.2010.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Khot10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Kolla10,
author = {Alexandra Kolla},
title = {Spectral Algorithms for Unique Games},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {122--130},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.20},
doi = {10.1109/CCC.2010.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Kolla10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MahmoodyX10,
author = {Mohammad Mahmoody and
David Xiao},
title = {On the Power of Randomized Reductions and the Checkability of {SAT}},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {64--75},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.16},
doi = {10.1109/CCC.2010.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/MahmoodyX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Marx10,
author = {D{\'{a}}niel Marx},
title = {Completely Inapproximable Monotone and Antimonotone Parameterized
Problems},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {181--187},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.25},
doi = {10.1109/CCC.2010.25},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Marx10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Nordstrom10,
author = {Jakob Nordstr{\"{o}}m},
title = {On the Relative Strength of Pebbling and Resolution},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {151--162},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.22},
doi = {10.1109/CCC.2010.22},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Nordstrom10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Raz10,
author = {Ran Raz},
title = {Parallel Repetition of Two Prover Games (Invited Survey)},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {3--6},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.9},
doi = {10.1109/CCC.2010.9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Raz10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Regev10,
author = {Oded Regev},
title = {The Learning with Errors Problem (Invited Survey)},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {191--204},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.26},
doi = {10.1109/CCC.2010.26},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Regev10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Shaltiel10,
author = {Ronen Shaltiel},
title = {Derandomized Parallel Repetition Theorems for Free Games},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {28--37},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.12},
doi = {10.1109/CCC.2010.12},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Shaltiel10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/StoleeBV10,
author = {Derrick Stolee and
Chris Bourke and
N. V. Vinodchandran},
title = {A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs
with Few Sources},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {131--138},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.36},
doi = {10.1109/CCC.2010.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/StoleeBV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Trevisan10,
author = {Luca Trevisan},
title = {The Program-Enumeration Bottleneck in Average-Case Complexity Theory},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {88--95},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.18},
doi = {10.1109/CCC.2010.18},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Trevisan10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2010,
title = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://ieeexplore.ieee.org/xpl/conhome/5497049/proceeding},
isbn = {978-0-7695-4060-3},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Aaronson09,
author = {Scott Aaronson},
title = {Quantum Copy-Protection and Quantum Money},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {229--242},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.42},
doi = {10.1109/CCC.2009.42},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Aaronson09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalW09,
author = {Manindra Agrawal and
Osamu Watanabe},
title = {One-Way Functions and the Berman-Hartmanis Conjecture},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {194--202},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.17},
doi = {10.1109/CCC.2009.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Amano09,
author = {Kazuyuki Amano},
title = {k-Subgraph Isomorphism on AC\({}_{\mbox{0}}\) Circuits},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {9--18},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.23},
doi = {10.1109/CCC.2009.23},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Amano09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AntunesF09,
author = {Luis Filipe Coelho Antunes and
Lance Fortnow},
title = {Worst-Case Running Times for Average-Case Algorithms},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {298--303},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.12},
doi = {10.1109/CCC.2009.12},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AntunesF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AustrinKS09,
author = {Per Austrin and
Subhash Khot and
Muli Safra},
title = {Inapproximability of Vertex Cover and Independent Set in Bounded Degree
Graphs},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {74--80},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.38},
doi = {10.1109/CCC.2009.38},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AustrinKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-SassonGKSV09,
author = {Eli Ben{-}Sasson and
Venkatesan Guruswami and
Tali Kaufman and
Madhu Sudan and
Michael Viderman},
title = {Locally Testable Codes Require Redundant Testers},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {52--61},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.6},
doi = {10.1109/CCC.2009.6},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ben-SassonGKSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Braverman09,
author = {Mark Braverman},
title = {Poly-logarithmic Independence Fools AC\({}^{\mbox{0}}\) Circuits},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {3--8},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.35},
doi = {10.1109/CCC.2009.35},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Braverman09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Brody09,
author = {Joshua Brody},
title = {The Maximum Communication Complexity of Multi-Party Pointer Jumping},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {379--386},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.30},
doi = {10.1109/CCC.2009.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Brody09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BrodyC09,
author = {Joshua Brody and
Amit Chakrabarti},
title = {A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {358--368},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.31},
doi = {10.1109/CCC.2009.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BrodyC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CharikarGM09,
author = {Moses Charikar and
Venkatesan Guruswami and
Rajsekar Manokaran},
title = {Every Permutation {CSP} of arity 3 is Approximation Resistant},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {62--73},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.29},
doi = {10.1109/CCC.2009.29},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CharikarGM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DattaLNTW09,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
title = {Planar Graph Isomorphism is in Log-Space},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {203--214},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.16},
doi = {10.1109/CCC.2009.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DattaLNTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Day09,
author = {Adam R. Day},
title = {Increasing the Gap between Descriptional Complexity and Algorithmic
Probability},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {263--273},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.13},
doi = {10.1109/CCC.2009.13},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Day09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DiakonikolasS09,
author = {Ilias Diakonikolas and
Rocco A. Servedio},
title = {Improved Approximation of Linear Threshold Functions},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {161--172},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.8},
doi = {10.1109/CCC.2009.8},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DiakonikolasS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Drucker09,
author = {Andrew Drucker},
title = {Multitask Efficiencies in the Decision Tree Model},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {286--297},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.33},
doi = {10.1109/CCC.2009.33},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Drucker09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Dvir09,
author = {Zeev Dvir},
title = {Extractors for Varieties},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {102--113},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.7},
doi = {10.1109/CCC.2009.7},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Dvir09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowSW09,
author = {Lance Fortnow and
Rahul Santhanam and
Ryan Williams},
title = {Fixed-Polynomial Size Circuit Bounds},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {19--26},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.21},
doi = {10.1109/CCC.2009.21},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FortnowSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GopalanLS09,
author = {Parikshit Gopalan and
Shachar Lovett and
Amir Shpilka},
title = {On the Complexity of Boolean Functions in Different Characteristics},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {173--183},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.14},
doi = {10.1109/CCC.2009.14},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GopalanLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HansenK09,
author = {Kristoffer Arnsfelt Hansen and
Michal Kouck{\'{y}}},
title = {A New Characterization of ACC\({}^{\mbox{0}}\) and Probabilistic CC\({}^{\mbox{0}}\)},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {27--34},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.15},
doi = {10.1109/CCC.2009.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HansenK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HrubesT09,
author = {Pavel Hrubes and
Iddo Tzameret},
title = {The Proof Complexity of Polynomial Identities},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {41--51},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.9},
doi = {10.1109/CCC.2009.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HrubesT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ItoKM09,
author = {Tsuyoshi Ito and
Hirotada Kobayashi and
Keiji Matsumoto},
title = {Oracularization and Two-Prover One-Round Interactive Proofs against
Nonlocal Strategies},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {217--228},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.22},
doi = {10.1109/CCC.2009.22},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ItoKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/JainK09,
author = {Rahul Jain and
Hartmut Klauck},
title = {New Results in the Simultaneous Message Passing Model via Information
Theoretic Techniques},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {369--378},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.28},
doi = {10.1109/CCC.2009.28},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/JainK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/JainW09,
author = {Rahul Jain and
John Watrous},
title = {Parallel Approximation of Non-interactive Zero-sum Quantum Games},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {243--253},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.26},
doi = {10.1109/CCC.2009.26},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/JainW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/JayramKR09,
author = {T. S. Jayram and
Swastik Kopparty and
Prasad Raghavendra},
title = {On the Communication Complexity of Read-Once {AC0} Formulae},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {329--340},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.39},
doi = {10.1109/CCC.2009.39},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/JayramKR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KarninS09,
author = {Zohar Shay Karnin and
Amir Shpilka},
title = {Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded
Top Fan-in},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {274--285},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.18},
doi = {10.1109/CCC.2009.18},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KarninS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Kawamura09,
author = {Akitoshi Kawamura},
title = {Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space
Complete},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {149--160},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.34},
doi = {10.1109/CCC.2009.34},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Kawamura09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Kayal09,
author = {Neeraj Kayal},
title = {The Complexity of the Annihilating Polynomial},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {184--193},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.37},
doi = {10.1109/CCC.2009.37},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Kayal09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KoiranP09,
author = {Pascal Koiran and
Sylvain Perifel},
title = {A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth
Threshold Circuits for the Permanent},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {35--40},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.19},
doi = {10.1109/CCC.2009.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KoiranP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Kralovic09,
author = {Richard Kr{\'{a}}lovic},
title = {Infinite vs. Finite Space-Bounded Randomized Computations},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {316--325},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.10},
doi = {10.1109/CCC.2009.10},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Kralovic09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeS09,
author = {Troy Lee and
Adi Shraibman},
title = {An Approximation Algorithm for Approximation Rank},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {351--357},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.25},
doi = {10.1109/CCC.2009.25},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LeeS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeSS09,
author = {Troy Lee and
Gideon Schechtman and
Adi Shraibman},
title = {Lower Bounds on Quantum Multiparty Communication Complexity},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {254--262},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.24},
doi = {10.1109/CCC.2009.24},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LeeSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeonardosS09,
author = {Nikos Leonardos and
Michael E. Saks},
title = {Lower Bounds on the Randomized Communication Complexity of Read-Once
Functions},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {341--350},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.32},
doi = {10.1109/CCC.2009.32},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LeonardosS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Rao09,
author = {Anup Rao},
title = {Extractors for Low-Weight Affine Sources},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {95--101},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.36},
doi = {10.1109/CCC.2009.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Rao09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/RothblumV09,
author = {Guy N. Rothblum and
Salil P. Vadhan},
title = {Are PCPs Inherent in Efficient Arguments?},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {81--92},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.40},
doi = {10.1109/CCC.2009.40},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/RothblumV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SaxenaS09,
author = {Nitin Saxena and
C. Seshadhri},
title = {An Almost Optimal Rank Bound for Depth-3 Identities},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {137--148},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.20},
doi = {10.1109/CCC.2009.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SaxenaS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Shaltiel09,
author = {Ronen Shaltiel},
title = {Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's
Lemma},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {114--125},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.27},
doi = {10.1109/CCC.2009.27},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Shaltiel09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TrevisanTV09,
author = {Luca Trevisan and
Madhur Tulsiani and
Salil P. Vadhan},
title = {Regularity, Boosting, and Efficiently Simulating Every High-Entropy
Distribution},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {126--136},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.41},
doi = {10.1109/CCC.2009.41},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/TrevisanTV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Xiao09,
author = {David Xiao},
title = {On Basing {ZK} {\(\not =\)} {BPP} on the Hardness of {PAC} Learning},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {304--315},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.11},
doi = {10.1109/CCC.2009.11},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Xiao09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2009,
title = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://ieeexplore.ieee.org/xpl/conhome/5231175/proceeding},
isbn = {978-0-7695-3717-7},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AaronsonBDFS08,
author = {Scott Aaronson and
Salman Beigi and
Andrew Drucker and
Bill Fefferman and
Peter W. Shor},
title = {The Power of Unentanglement},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {223--236},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.5},
doi = {10.1109/CCC.2008.5},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AaronsonBDFS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderK08,
author = {Eric Allender and
Michal Kouck{\'{y}}},
title = {Amplifying Lower Bounds by Means of Self-Reducibility},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {31--40},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.11},
doi = {10.1109/CCC.2008.11},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ArvindMS08,
author = {Vikraman Arvind and
Partha Mukhopadhyay and
Srikanth Srinivasan},
title = {New Results on Noncommutative and Commutative Polynomial Identity
Testing},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {268--279},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.22},
doi = {10.1109/CCC.2008.22},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ArvindMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AustrinM08,
author = {Per Austrin and
Elchanan Mossel},
title = {Approximation Resistant Predicates from Pairwise Independence},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {249--258},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.20},
doi = {10.1109/CCC.2008.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AustrinM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-AroyaST08,
author = {Avraham Ben{-}Aroya and
Oded Schwartz and
Amnon Ta{-}Shma},
title = {Quantum Expanders: Motivation and Constructions},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {292--303},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.23},
doi = {10.1109/CCC.2008.23},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ben-AroyaST08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanH08,
author = {Harry Buhrman and
John M. Hitchcock},
title = {NP-Hard Sets Are Exponentially Dense Unless coNP {C} NP/poly},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {1--7},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.21},
doi = {10.1109/CCC.2008.21},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanKV08,
author = {Harry Buhrman and
Michal Kouck{\'{y}} and
Nikolai K. Vereshchagin},
title = {Randomised Individual Communication Complexity},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {321--331},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.33},
doi = {10.1109/CCC.2008.33},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanKV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChangP08,
author = {Richard Chang and
Suresh Purini},
title = {Amplifying {ZPPSAT[1]} and the Two Queries Problem},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {41--52},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.32},
doi = {10.1109/CCC.2008.32},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChangP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DemaineH08,
author = {Erik D. Demaine and
Robert A. Hearn},
title = {Constraint Logic: {A} Uniform Framework for Modeling Computation as
Games},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {149--162},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.35},
doi = {10.1109/CCC.2008.35},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DemaineH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DohertyLTW08,
author = {Andrew C. Doherty and
Yeong{-}Cherng Liang and
Ben Toner and
Stephanie Wehner},
title = {The Quantum Moment Problem and Bounds on Entangled Multi-prover Games},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {199--210},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.26},
doi = {10.1109/CCC.2008.26},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DohertyLTW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DvirS08,
author = {Zeev Dvir and
Amir Shpilka},
title = {Noisy Interpolating Sets for Low Degree Polynomials},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {140--148},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.14},
doi = {10.1109/CCC.2008.14},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DvirS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DvirS08a,
author = {Zeev Dvir and
Amir Shpilka},
title = {Towards Dimension Expanders over Finite Fields},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {304--310},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.19},
doi = {10.1109/CCC.2008.19},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DvirS08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/EickmeyerGG08,
author = {Kord Eickmeyer and
Martin Grohe and
Magdalena Gr{\"{u}}ber},
title = {Approximation of Natural W[P]-Complete Minimisation Problems Is Hard},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {8--18},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.24},
doi = {10.1109/CCC.2008.24},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/EickmeyerGG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GavinskyP08,
author = {Dmitry Gavinsky and
Pavel Pudl{\'{a}}k},
title = {Exponential Separation of Quantum and Classical Non-interactive Multi-party
Communication Complexity},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {332--339},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.27},
doi = {10.1109/CCC.2008.27},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GavinskyP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GopalanG08,
author = {Parikshit Gopalan and
Venkatesan Guruswami},
title = {Hardness Amplification within {NP} against Deterministic Algorithms},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {19--30},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.17},
doi = {10.1109/CCC.2008.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GopalanG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GrigorescuKS08,
author = {Elena Grigorescu and
Tali Kaufman and
Madhu Sudan},
title = {2-Transitivity Is Insufficient for Local Testability},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {259--267},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.31},
doi = {10.1109/CCC.2008.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GrigorescuKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiR08,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {Soft Decoding, Dual {BCH} Codes, and Better List-Decodable e-Biased
Codes},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {163--174},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.13},
doi = {10.1109/CCC.2008.13},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hansen08,
author = {Kristoffer Arnsfelt Hansen},
title = {Constant Width Planar Branching Programs Characterize {ACC0} in Quasipolynomial
Size},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {92--99},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.30},
doi = {10.1109/CCC.2008.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Hansen08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ItoKPSY08,
author = {Tsuyoshi Ito and
Hirotada Kobayashi and
Daniel Preda and
Xiaoming Sun and
Andrew Chi{-}Chih Yao},
title = {Generalized Tsirelson Inequalities, Commuting-Operator Provers, and
Multi-prover Interactive Proof Systems},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {187--198},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.12},
doi = {10.1109/CCC.2008.12},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ItoKPSY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KarninS08,
author = {Zohar Shay Karnin and
Amir Shpilka},
title = {Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic
Circuits with Bounded Top Fan-In},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {280--291},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.15},
doi = {10.1109/CCC.2008.15},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KarninS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KedlayaY08,
author = {Kiran S. Kedlaya and
Sergey Yekhanin},
title = {Locally Decodable Codes From Nice Subsets of Finite Fields and Prime
Factors of Mersenne Numbers},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {175--186},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.7},
doi = {10.1109/CCC.2008.7},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KedlayaY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KempeKMV08,
author = {Julia Kempe and
Hirotada Kobayashi and
Keiji Matsumoto and
Thomas Vidick},
title = {Using Entanglement in Quantum Multi-prover Interactive Proofs},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {211--222},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.6},
doi = {10.1109/CCC.2008.6},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KempeKMV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KoppartyY08,
author = {Swastik Kopparty and
Sergey Yekhanin},
title = {Detecting Rational Points on Hypersurfaces over Finite Fields},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {311--320},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.36},
doi = {10.1109/CCC.2008.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KoppartyY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeS08,
author = {Troy Lee and
Adi Shraibman},
title = {Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {81--91},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.29},
doi = {10.1109/CCC.2008.29},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LeeS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeSS08,
author = {Troy Lee and
Adi Shraibman and
Robert Spalek},
title = {A Direct Product Theorem for Discrepancy},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {71--80},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.25},
doi = {10.1109/CCC.2008.25},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LeeSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LinialS08,
author = {Nati Linial and
Adi Shraibman},
title = {Learning Complexity vs. Communication Complexity},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {53--63},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.28},
doi = {10.1109/CCC.2008.28},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LinialS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/RazY08,
author = {Ran Raz and
Amir Yehudayoff},
title = {Lower Bounds and Separations for Constant Depth Multilinear Circuits},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {128--139},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.8},
doi = {10.1109/CCC.2008.8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/RazY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Segerlind08,
author = {Nathan Segerlind},
title = {On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary
Decision Diagram Proofs},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {100--111},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.34},
doi = {10.1109/CCC.2008.34},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Segerlind08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Sherstov08,
author = {Alexander A. Sherstov},
title = {Communication Complexity under Product and Nonproduct Distributions},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {64--70},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.10},
doi = {10.1109/CCC.2008.10},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Sherstov08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Sherstov08a,
author = {Alexander A. Sherstov},
title = {Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {112--123},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.18},
doi = {10.1109/CCC.2008.18},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Sherstov08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Spalek08,
author = {Robert Spalek},
title = {The Multiplicative Quantum Adversary},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {237--248},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.9},
doi = {10.1109/CCC.2008.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Spalek08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Viola08,
author = {Emanuele Viola},
title = {The Sum of d Small-Bias Generators Fools Polynomials of Degree d},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {124--127},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.16},
doi = {10.1109/CCC.2008.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Viola08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2008,
title = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://ieeexplore.ieee.org/xpl/conhome/4558793/proceeding},
isbn = {978-0-7695-3169-4},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AaronsonK07,
author = {Scott Aaronson and
Greg Kuperberg},
title = {Quantum versus Classical Proofs and Advice},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {115--128},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.27},
doi = {10.1109/CCC.2007.27},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AaronsonK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmbainisE07,
author = {Andris Ambainis and
Joseph Emerson},
title = {Quantum t-designs: t-wise Independence in the Quantum World},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {129--140},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.26},
doi = {10.1109/CCC.2007.26},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AmbainisE07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AntunesFPS07,
author = {Luis Antunes and
Lance Fortnow and
Alexandre Pinto and
Andre Souto},
title = {Low-Depth Witnesses are Easy to Find},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {46--51},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.13},
doi = {10.1109/CCC.2007.13},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AntunesFPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BourkeTV07,
author = {Chris Bourke and
Raghunath Tewari and
N. V. Vinodchandran},
title = {Directed Planar Reachability is in Unambiguous Log-Space},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {217--221},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.9},
doi = {10.1109/CCC.2007.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BourkeTV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BravermanKR07,
author = {Mark Braverman and
Raghav Kulkarni and
Sambuddha Roy},
title = {Parity Problems in Planar Graphs},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {222--235},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.23},
doi = {10.1109/CCC.2007.23},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BravermanKR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanVW07,
author = {Harry Buhrman and
Nikolai K. Vereshchagin and
Ronald de Wolf},
title = {On Computation and Communication with Small Bias},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {24--32},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.18},
doi = {10.1109/CCC.2007.18},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanVW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CaiCL07,
author = {Jin{-}yi Cai and
Vinay Choudhary and
Pinyan Lu},
title = {On the Theory of Matchgate Computations},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {305--318},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.22},
doi = {10.1109/CCC.2007.22},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CaiCL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CaiL07,
author = {Jin{-}yi Cai and
Pinyan Lu},
title = {Bases Collapse in Holographic Algorithms},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {292--304},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.6},
doi = {10.1109/CCC.2007.6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CaiL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Chakrabarti07,
author = {Amit Chakrabarti},
title = {Lower Bounds for Multi-Player Pointer Jumping},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {33--45},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.14},
doi = {10.1109/CCC.2007.14},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Chakrabarti07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChangP07,
author = {Richard Chang and
Suresh Purini},
title = {Bounded Queries and the {NP} Machine Hypothesis},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {52--59},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.7},
doi = {10.1109/CCC.2007.7},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChangP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChenF07,
author = {Yijia Chen and
J{\"{o}}rg Flum},
title = {On Parameterized Path and Chordless Path Problems},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {250--263},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.21},
doi = {10.1109/CCC.2007.21},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChenF07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChungRV07,
author = {Kai{-}Min Chung and
Omer Reingold and
Salil P. Vadhan},
title = {{S-T} Connectivity on Digraphs with a Known Stationary Distribution},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {236--249},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.30},
doi = {10.1109/CCC.2007.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChungRV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CleveSUU07,
author = {Richard Cleve and
William Slofstra and
Falk Unger and
Sarvagya Upadhyay},
title = {Perfect Parallel Repetition Theorem for Quantum {XOR} Proof Systems},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {109--114},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.24},
doi = {10.1109/CCC.2007.24},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CleveSUU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigeKO07,
author = {Uriel Feige and
Guy Kindler and
Ryan O'Donnell},
title = {Understanding Parallel Repetition Requires Understanding Foams},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {179--192},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.39},
doi = {10.1109/CCC.2007.39},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FeigeKO07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiUV07,
author = {Venkatesan Guruswami and
Christopher Umans and
Salil P. Vadhan},
title = {Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy
Codes},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {96--108},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.38},
doi = {10.1109/CCC.2007.38},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiUV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HaitnerR07,
author = {Iftach Haitner and
Omer Reingold},
title = {A New Interactive Hashing Theorem},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {319--332},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.3},
doi = {10.1109/CCC.2007.3},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HaitnerR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HalevyLNT07,
author = {Shirley Halevy and
Oded Lachish and
Ilan Newman and
Dekel Tsur},
title = {Testing Properties of Constraint-Graphs},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {264--277},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.31},
doi = {10.1109/CCC.2007.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HalevyLNT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HarshaJMR07,
author = {Prahladh Harsha and
Rahul Jain and
David A. McAllester and
Jaikumar Radhakrishnan},
title = {The Communication Complexity of Correlation},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {10--23},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.32},
doi = {10.1109/CCC.2007.32},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HarshaJMR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/IshaiKO07,
author = {Yuval Ishai and
Eyal Kushilevitz and
Rafail Ostrovsky},
title = {Efficient Arguments without Short PCPs},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {278--291},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.10},
doi = {10.1109/CCC.2007.10},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/IshaiKO07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Malod07,
author = {Guillaume Malod},
title = {The Complexity of Polynomials and Their Coefficient Functions},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {193--204},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.33},
doi = {10.1109/CCC.2007.33},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Malod07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MerkleS07,
author = {Wolfgang Merkle and
Frank Stephan},
title = {On C-Degrees, H-Degrees and T-Degrees},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {60--69},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.17},
doi = {10.1109/CCC.2007.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/MerkleS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Peikert07,
author = {Chris Peikert},
title = {Limits on the Hardness of Lattice Problems in ell {\_}p Norms},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {333--346},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.12},
doi = {10.1109/CCC.2007.12},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Peikert07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Pervyshev07,
author = {Konstantin Pervyshev},
title = {On Heuristic Time Hierarchies},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {347--358},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.20},
doi = {10.1109/CCC.2007.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Pervyshev07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SchoenebeckTT07,
author = {Grant Schoenebeck and
Luca Trevisan and
Madhur Tulsiani},
title = {A Linear Round Lower Bound for Lovasz-Schrijver {SDP} Relaxations
of Vertex Cover},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {205--216},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.2},
doi = {10.1109/CCC.2007.2},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SchoenebeckTT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Sherstov07,
author = {Alexander A. Sherstov},
title = {Halfspace Matrices},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {83--95},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.11},
doi = {10.1109/CCC.2007.11},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Sherstov07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/UchizawaT07,
author = {Kei Uchizawa and
Eiji Takimoto},
title = {An Exponential Lower Bound on the Size of Constant-Depth Threshold
Circuits with Small Energy Complexity},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {169--178},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.4},
doi = {10.1109/CCC.2007.4},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/UchizawaT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Viola07,
author = {Emanuele Viola},
title = {On Approximate Majority and Probabilistic Time},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {155--168},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.16},
doi = {10.1109/CCC.2007.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Viola07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ViolaW07,
author = {Emanuele Viola and
Avi Wigderson},
title = {Norms, {XOR} Lemmas, and Lower Bounds for {GF(2)} Polynomials and
Multiparty Protocols},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {141--154},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.15},
doi = {10.1109/CCC.2007.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ViolaW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Williams07,
author = {Ryan Williams},
title = {Time-Space Tradeoffs for Counting {NP} Solutions Modulo Integers},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {70--82},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.34},
doi = {10.1109/CCC.2007.34},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Williams07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Zimand07,
author = {Marius Zimand},
title = {On Derandomizing Probabilistic Sublinear-Time Algorithms},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {1--9},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.19},
doi = {10.1109/CCC.2007.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Zimand07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2007,
title = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://ieeexplore.ieee.org/xpl/conhome/4262736/proceeding},
isbn = {0-7695-2780-9},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Aaronson06,
author = {Scott Aaronson},
title = {QMA/qpoly {\textbackslash}subseteq PSPACE/poly: De-Merlinizing Quantum
Protocols},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {261--273},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.36},
doi = {10.1109/CCC.2006.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Aaronson06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Aaronson06a,
author = {Scott Aaronson},
title = {Oracles Are Subtle But Not Malicious},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {340--354},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.32},
doi = {10.1109/CCC.2006.32},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Aaronson06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderBCDR06,
author = {Eric Allender and
David A. Mix Barrington and
Tanmoy Chakraborty and
Samir Datta and
Sambuddha Roy},
title = {Grid Graph Reachability Problems},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {299--313},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.22},
doi = {10.1109/CCC.2006.22},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderBCDR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderBKM06,
author = {Eric Allender and
Peter B{\"{u}}rgisser and
Johan Kjeldgaard{-}Pedersen and
Peter Bro Miltersen},
title = {On the Complexity of Numerical Analysis},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {331--339},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.30},
doi = {10.1109/CCC.2006.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderBKM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderHMPS06,
author = {Eric Allender and
Lisa Hellerstein and
Paul McCabe and
Toniann Pitassi and
Michael E. Saks},
title = {Minimizing {DNF} Formulas and AC\({}^{\mbox{0}}\)\({}_{\mbox{d}}\)
Circuits Given a Truth Table},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {237--251},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.27},
doi = {10.1109/CCC.2006.27},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderHMPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Atserias06,
author = {Albert Atserias},
title = {Distinguishing {SAT} from Polynomial-Size Circuits, through Black-Box
Queries},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {88--95},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.17},
doi = {10.1109/CCC.2006.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Atserias06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BehlL06,
author = {Christoph Behle and
Klaus{-}J{\"{o}}rn Lange},
title = {FO[{\textless}]-Uniformity},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {183--189},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.20},
doi = {10.1109/CCC.2006.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BehlL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Buresh-OppenheimS06,
author = {Joshua Buresh{-}Oppenheim and
Rahul Santhanam},
title = {Making Hard Problems Harder},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {73--87},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.26},
doi = {10.1109/CCC.2006.26},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Buresh-OppenheimS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CalabroIP06,
author = {Chris Calabro and
Russell Impagliazzo and
Ramamohan Paturi},
title = {A Duality between Clause Width and Clause Density for {SAT}},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {252--260},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.6},
doi = {10.1109/CCC.2006.6},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CalabroIP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChenG06,
author = {Yijia Chen and
Martin Grohe},
title = {An Isomorphism between Subexponential and Parameterized Complexity
Theory},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {314--330},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.8},
doi = {10.1109/CCC.2006.8},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChenG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Feldman06,
author = {Vitaly Feldman},
title = {Optimal Hardness Results for Maximizing Agreements with Monomials},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {226--236},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.31},
doi = {10.1109/CCC.2006.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Feldman06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GavinskyKW06,
author = {Dmitry Gavinsky and
Julia Kempe and
Ronald de Wolf},
title = {Strengths and Weaknesses of Quantum Fingerprinting},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {288--298},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.39},
doi = {10.1109/CCC.2006.39},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GavinskyKW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Gopalan06,
author = {Parikshit Gopalan},
title = {Constructing Ramsey Graphs from Boolean Function Representations},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {115--128},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.14},
doi = {10.1109/CCC.2006.14},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Gopalan06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hansen06,
author = {Kristoffer Arnsfelt Hansen},
title = {On Modular Counting with Polynomials},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {202--212},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.29},
doi = {10.1109/CCC.2006.29},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Hansen06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HavivR06,
author = {Ishay Haviv and
Oded Regev},
title = {Hardness of the Covering Radius Problem on Lattices},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {145--158},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.23},
doi = {10.1109/CCC.2006.23},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HavivR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KayalS06,
author = {Neeraj Kayal and
Nitin Saxena},
title = {Polynomial Identity Testing for Depth 3 Circuits},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {9--17},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.34},
doi = {10.1109/CCC.2006.34},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KayalS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KhotS06,
author = {Subhash Khot and
Rishi Saket},
title = {A 3-Query Non-Adaptive {PCP} with Perfect Completeness},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {159--169},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.5},
doi = {10.1109/CCC.2006.5},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KhotS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KouckyLPT06,
author = {Michal Kouck{\'{y}} and
Clemens Lautemann and
Sebastian Poloczek and
Denis Th{\'{e}}rien},
title = {Circuit Lower Bounds via Ehrenfeucht-Fraisse Games},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {190--201},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.12},
doi = {10.1109/CCC.2006.12},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KouckyLPT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MelkebeekP06,
author = {Dieter van Melkebeek and
Konstantin Pervyshev},
title = {A Generic Time Hierarchy for Semantic Models with One Bit of Advice},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {129--144},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.7},
doi = {10.1109/CCC.2006.7},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/MelkebeekP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ODonnellS06,
author = {Ryan O'Donnell and
Rocco A. Servedio},
title = {Learning Monotone Decision Trees in Polynomial Time},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {213--225},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.25},
doi = {10.1109/CCC.2006.25},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ODonnellS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Pass06,
author = {Rafael Pass},
title = {Parallel Repetition of Zero-Knowledge Proofs and the Possibility of
Basing Cryptography on NP-Hardness},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {96--110},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.33},
doi = {10.1109/CCC.2006.33},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Pass06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Pudlak06,
author = {Pavel Pudl{\'{a}}k},
title = {Godel and Computations (Abstract)},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {3--5},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.21},
doi = {10.1109/CCC.2006.21},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Pudlak06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Sen06,
author = {Pranab Sen},
title = {Random Measurement Bases, Quantum State Distinction and Applications
to the Hidden Subgroup Problem},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {274--287},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.37},
doi = {10.1109/CCC.2006.37},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Sen06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Servedio06,
author = {Rocco A. Servedio},
title = {Every Linear Threshold Function has a Low-Weight Approximator},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {18--32},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.18},
doi = {10.1109/CCC.2006.18},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Servedio06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Shaltiel06,
author = {Ronen Shaltiel},
title = {How to Get More Mileage from Randomness Extractors},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {46--60},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.24},
doi = {10.1109/CCC.2006.24},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Shaltiel06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Shpilka06,
author = {Amir Shpilka},
title = {Constructions of Low-Degree and Error-Correcting in-Biased Generators},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {33--45},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.15},
doi = {10.1109/CCC.2006.15},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Shpilka06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Tourlakis06,
author = {Iannis Tourlakis},
title = {New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {170--182},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.28},
doi = {10.1109/CCC.2006.28},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Tourlakis06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Venkateswaran06,
author = {H. Venkateswaran},
title = {Derandomization of Probabilistic Auxiliary Pushdown Automata Classes},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {355--370},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.16},
doi = {10.1109/CCC.2006.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Venkateswaran06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Wigderson06,
author = {Avi Wigderson},
title = {Applications of the Sum-Product Theorem in Finite Fields},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {111},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.9},
doi = {10.1109/CCC.2006.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Wigderson06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/X06,
title = {Preface},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.35},
doi = {10.1109/CCC.2006.35},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/X06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/X06a,
title = {Committees},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.13},
doi = {10.1109/CCC.2006.13},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/X06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/X06b,
title = {Reviewers},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.38},
doi = {10.1109/CCC.2006.38},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/X06b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/X06c,
title = {Awards},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.11},
doi = {10.1109/CCC.2006.11},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/X06c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Zimand06,
author = {Marius Zimand},
title = {Exposure-Resilient Extractors},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {61--72},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.19},
doi = {10.1109/CCC.2006.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Zimand06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2006,
title = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://ieeexplore.ieee.org/xpl/conhome/11039/proceeding},
isbn = {0-7695-2596-2},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AlekhnovichBBIMP05,
author = {Michael Alekhnovich and
Allan Borodin and
Joshua Buresh{-}Oppenheim and
Russell Impagliazzo and
Avner Magen and
Toniann Pitassi},
title = {Toward a Model for Backtracking and Dynamic Programming},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {308--322},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.32},
doi = {10.1109/CCC.2005.32},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AlekhnovichBBIMP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderDR05,
author = {Eric Allender and
Samir Datta and
Sambuddha Roy},
title = {Topology Inside NC{\({^1}\)}},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {298--307},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.31},
doi = {10.1109/CCC.2005.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderDR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ApplebaumIK05,
author = {Benny Applebaum and
Yuval Ishai and
Eyal Kushilevitz},
title = {Computationally Private Randomizing Polynomials and Their Applications},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {260--274},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.9},
doi = {10.1109/CCC.2005.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ApplebaumIK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ArvindKV05,
author = {Vikraman Arvind and
Piyush P. Kurur and
T. C. Vijayaraghavan},
title = {Bounded Color Multiplicity Graph Isomorphism is in the {\#}L Hierarchy},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {13--27},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.7},
doi = {10.1109/CCC.2005.7},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ArvindKV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeamePSW05,
author = {Paul Beame and
Toniann Pitassi and
Nathan Segerlind and
Avi Wigderson},
title = {A Direct Sum Theorem for Corruption and the Multiparty {NOF} Communication
Complexity of Set Disjointness},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {52--66},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.1},
doi = {10.1109/CCC.2005.1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BeamePSW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeimelW05,
author = {Amos Beimel and
Enav Weinreb},
title = {Monotone Circuits for Weighted Threshold Functions},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {67--75},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.12},
doi = {10.1109/CCC.2005.12},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeimelW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-SassonGHSV05,
author = {Eli Ben{-}Sasson and
Oded Goldreich and
Prahladh Harsha and
Madhu Sudan and
Salil P. Vadhan},
title = {Short PCPs Verifiable in Polylogarithmic Time},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {120--134},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.27},
doi = {10.1109/CCC.2005.27},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ben-SassonGHSV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BogdanovW05,
author = {Andrej Bogdanov and
Hoeteck Wee},
title = {More on Noncommutative Polynomial Identity Testing},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {92--99},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.13},
doi = {10.1109/CCC.2005.13},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BogdanovW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Chakraborty05,
author = {Sourav Chakraborty},
title = {On the Sensitivity of Cyclically-Invariant Boolean Functions},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {163--167},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.38},
doi = {10.1109/CCC.2005.38},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Chakraborty05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChawlaKKRS05,
author = {Shuchi Chawla and
Robert Krauthgamer and
Ravi Kumar and
Yuval Rabani and
D. Sivakumar},
title = {On the Hardness of Approximating Multicut and Sparsest-Cut},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {144--153},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.20},
doi = {10.1109/CCC.2005.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChawlaKKRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FischerF05,
author = {Eldar Fischer and
Lance Fortnow},
title = {Tolerant Versus Intolerant Testing for Boolean Properties},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {135--140},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.30},
doi = {10.1109/CCC.2005.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FischerF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowIKU05,
author = {Lance Fortnow and
Russell Impagliazzo and
Valentine Kabanets and
Christopher Umans},
title = {On the Complexity of Succinct Zero-Sum Games},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {323--332},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.18},
doi = {10.1109/CCC.2005.18},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/FortnowIKU05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowK05,
author = {Lance Fortnow and
Adam R. Klivans},
title = {{NP} with Small Advice},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {228--234},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.15},
doi = {10.1109/CCC.2005.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FortnowK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiK05,
author = {Venkatesan Guruswami and
Subhash Khot},
title = {Hardness of Max 3SAT with No Mixed Clauses},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {154--162},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.10},
doi = {10.1109/CCC.2005.10},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GutfreundST05,
author = {Dan Gutfreund and
Ronen Shaltiel and
Amnon Ta{-}Shma},
title = {If {NP} Languages are Hard on the Worst-Case Then It is Easy to Find
Their Hard Instances},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {243--257},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.11},
doi = {10.1109/CCC.2005.11},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GutfreundST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Gutoski05,
author = {Gus Gutoski},
title = {Upper Bounds for Quantum Interactive Proofs with Competing Provers},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {334--343},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.37},
doi = {10.1109/CCC.2005.37},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Gutoski05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HoangT05,
author = {Thanh Minh Hoang and
Thomas Thierauf},
title = {The Complexity of the Inertia and Some Closure Properties of GapL},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {28--37},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.28},
doi = {10.1109/CCC.2005.28},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HoangT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/JainRS05,
author = {Rahul Jain and
Jaikumar Radhakrishnan and
Pranab Sen},
title = {Prior Entanglement, Message Compression and Privacy in Quantum Communication},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {285--296},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.24},
doi = {10.1109/CCC.2005.24},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/JainRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KayalS05,
author = {Neeraj Kayal and
Nitin Saxena},
title = {On the Ring Isomorphism and Automorphism Problems},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {2--12},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.22},
doi = {10.1109/CCC.2005.22},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KayalS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LaplanteLS05,
author = {Sophie Laplante and
Troy Lee and
Mario Szegedy},
title = {The Quantum Adversary Method and Classical Formula Size Lower Bounds},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {76--90},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.29},
doi = {10.1109/CCC.2005.29},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LaplanteLS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LiptonMMV05,
author = {Richard J. Lipton and
Evangelos Markakis and
Aranyak Mehta and
Nisheeth K. Vishnoi},
title = {On the Fourier Spectrum of Symmetric Boolean Functions with Applications
to Learning Symmetric Juntas},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {112--119},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.19},
doi = {10.1109/CCC.2005.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LiptonMMV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LuTW05,
author = {Chi{-}Jen Lu and
Shi{-}Chun Tsai and
Hsin{-}Lung Wu},
title = {On the Complexity of Hardness Amplification},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {170--182},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.17},
doi = {10.1109/CCC.2005.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LuTW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/NickelsenS05,
author = {Arfst Nickelsen and
Birgit Schelm},
title = {Average-Case Computations - Comparing AvgP, HP, and Nearly-P},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {235--242},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.4},
doi = {10.1109/CCC.2005.4},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/NickelsenS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Rosgen05,
author = {Bill Rosgen},
title = {On the Hardness of Distinguishing Mixed-State Quantum Computations},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {344--354},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.21},
doi = {10.1109/CCC.2005.21},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Rosgen05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ShaltielU05,
author = {Ronen Shaltiel and
Christopher Umans},
title = {Pseudorandomness for Approximate Counting and Sampling},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {212--226},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.26},
doi = {10.1109/CCC.2005.26},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ShaltielU05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Viola05,
author = {Emanuele Viola},
title = {On Constructing Parallel Pseudorandom Generators from One-Way Functions},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {183--197},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.16},
doi = {10.1109/CCC.2005.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Viola05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Viola05a,
author = {Emanuele Viola},
title = {Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric
Gates},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {198--209},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.25},
doi = {10.1109/CCC.2005.25},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Viola05a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/WegenerW05,
author = {Ingo Wegener and
Philipp Woelfel},
title = {New Results on the Complexity of the Middle Bit of Multiplication},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {100--110},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.14},
doi = {10.1109/CCC.2005.14},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/WegenerW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Williams05,
author = {Ryan Williams},
title = {Better Time-Space Lower Bounds for {SAT} and Related Problems},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {40--49},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.6},
doi = {10.1109/CCC.2005.6},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Williams05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/WoodruffY05,
author = {David P. Woodruff and
Sergey Yekhanin},
title = {A Geometric Approach to Information-Theoretic Private Information
Retrieval},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {275--284},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.2},
doi = {10.1109/CCC.2005.2},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/WoodruffY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/X05,
title = {Preface},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.23},
doi = {10.1109/CCC.2005.23},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/X05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/X05a,
title = {Committees},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.8},
doi = {10.1109/CCC.2005.8},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/X05a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/X05b,
title = {Awards},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.5},
doi = {10.1109/CCC.2005.5},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/X05b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2005,
title = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://ieeexplore.ieee.org/xpl/conhome/9851/proceeding},
isbn = {0-7695-2364-1},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Aaronson04,
author = {Scott Aaronson},
title = {Limitations of Quantum Advice and One-Way Communication},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {320--332},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313854},
doi = {10.1109/CCC.2004.1313854},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Aaronson04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmbainisBDR04,
author = {Andris Ambainis and
Harry Buhrman and
Yevgeniy Dodis and
Hein R{\"{o}}hrig},
title = {Multiparty Quantum Coin Flipping},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {250--259},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313848},
doi = {10.1109/CCC.2004.1313848},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AmbainisBDR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmbainisY04,
author = {Andris Ambainis and
Ke Yang},
title = {Towards the Classical Communication Complexity of Entanglement Distillation
Protocols with Incomplete Information},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {305--319},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313853},
doi = {10.1109/CCC.2004.1313853},
timestamp = {Fri, 05 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AmbainisY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ArvindT04,
author = {Vikraman Arvind and
Jacobo Tor{\'{a}}n},
title = {Solvable Group Isomorphism},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {91--103},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313808},
doi = {10.1109/CCC.2004.1313808},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ArvindT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ArvindV04,
author = {Vikraman Arvind and
T. C. Vijayaraghavan},
title = {Abelian Permutation Group Problems and Logspace Counting Classes},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {204--214},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313844},
doi = {10.1109/CCC.2004.1313844},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ArvindV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BasuBGL04,
author = {Saugata Basu and
Nayantara Bhatnagar and
Parikshit Gopalan and
Richard J. Lipton},
title = {Polynomials That Sign Represent Parity and Descartes Rule of Signs},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {223--235},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313846},
doi = {10.1109/CCC.2004.1313846},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BasuBGL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BogdanovT04,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {Lower Bounds for Testing Bipartiteness in Dense Graphs},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {75--81},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313803},
doi = {10.1109/CCC.2004.1313803},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BogdanovT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanLM04,
author = {Harry Buhrman and
Troy Lee and
Dieter van Melkebeek},
title = {Language Compression and Pseudorandom Generators},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {15--28},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313772},
doi = {10.1109/CCC.2004.1313772},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanLM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanT04,
author = {Harry Buhrman and
Leen Torenvliet},
title = {Separating Complexity Classes Using Structural Properties},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {130--138},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313820},
doi = {10.1109/CCC.2004.1313820},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Buresh-OppenheimM04,
author = {Josh Buresh{-}Oppenheim and
Tsuyoshi Morioka},
title = {Relativized {NP} Search Problems and Propositional Proof Systems},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {54--67},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313795},
doi = {10.1109/CCC.2004.1313795},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Buresh-OppenheimM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChenCFHJKX04,
author = {Jianer Chen and
Benny Chor and
Mike Fellows and
Xiuzhen Huang and
David W. Juedes and
Iyad A. Kanj and
Ge Xia},
title = {Tight Lower Bounds for Certain Parameterized NP-Hard Problems},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {150--160},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313826},
doi = {10.1109/CCC.2004.1313826},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChenCFHJKX04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CleveHTW04,
author = {Richard Cleve and
Peter H{\o}yer and
Benjamin Toner and
John Watrous},
title = {Consequences and Limits of Nonlocal Strategies},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {236--249},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313847},
doi = {10.1109/CCC.2004.1313847},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CleveHTW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GalesiT04,
author = {Nicola Galesi and
Neil Thapen},
title = {The Complexity of Treelike Systems over lamda-Local Formulae},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {68--74},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313798},
doi = {10.1109/CCC.2004.1313798},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GalesiT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GlasserPSS04,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Alan L. Selman and
Samik Sengupta},
title = {Properties of NP-Complete Sets},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {184--197},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313839},
doi = {10.1109/CCC.2004.1313839},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GlasserPSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GlasserSS04,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Samik Sengupta},
title = {Reductions between Disjoint NP-Pairs},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {42--53},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313791},
doi = {10.1109/CCC.2004.1313791},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GlasserSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiMR04,
author = {Venkatesan Guruswami and
Daniele Micciancio and
Oded Regev},
title = {The Complexity of the Covering Radius Problem on Lattices and Codes},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {161--173},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313831},
doi = {10.1109/CCC.2004.1313831},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiMR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hitchcock04,
author = {John M. Hitchcock},
title = {Small Spans in Scaled Dimension},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {104--112},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313811},
doi = {10.1109/CCC.2004.1313811},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Hitchcock04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HitchcockPV04,
author = {John M. Hitchcock and
Aduri Pavan and
N. V. Vinodchandran},
title = {Partial Bi-immunity and NP-Completeness},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {198--203},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313842},
doi = {10.1109/CCC.2004.1313842},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HitchcockPV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HitchcockV04,
author = {John M. Hitchcock and
N. V. Vinodchandran},
title = {Dimension, Entropy Rates, and Compression},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {174--183},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313835},
doi = {10.1109/CCC.2004.1313835},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HitchcockV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Lange04,
author = {Klaus{-}J{\"{o}}rn Lange},
title = {Some Results on Majority Quantifiers over Words},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {123--129},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313817},
doi = {10.1109/CCC.2004.1313817},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Lange04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LaplanteM04,
author = {Sophie Laplante and
Fr{\'{e}}d{\'{e}}ric Magniez},
title = {Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov
Arguments},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {294--304},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313852},
doi = {10.1109/CCC.2004.1313852},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LaplanteM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MarriottW04,
author = {Chris Marriott and
John Watrous},
title = {Quantum Arthur-Merlin Games},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {275--285},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313850},
doi = {10.1109/CCC.2004.1313850},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/MarriottW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Marx04,
author = {D{\'{a}}niel Marx},
title = {Parameterized Complexity of Constraint Satisfaction Problems},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {139--149},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313823},
doi = {10.1109/CCC.2004.1313823},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Marx04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Newman04,
author = {Ilan Newman},
title = {Computing in Fault Tolerance Broadcast Networks},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {113--122},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313813},
doi = {10.1109/CCC.2004.1313813},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Newman04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/RazS04,
author = {Ran Raz and
Amir Shpilka},
title = {Deterministic Polynomial Identity Testing in Non-Commutative Models},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {215--222},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313845},
doi = {10.1109/CCC.2004.1313845},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/RazS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/RazS04a,
author = {Ran Raz and
Amir Shpilka},
title = {On the Power of Quantum Proofs},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {260--274},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313849},
doi = {10.1109/CCC.2004.1313849},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/RazS04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SelmanS04,
author = {Alan L. Selman and
Samik Sengupta},
title = {Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential
Hierarchy},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {82--90},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313805},
doi = {10.1109/CCC.2004.1313805},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SelmanS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SunYZ04,
author = {Xiaoming Sun and
Andrew Chi{-}Chih Yao and
Shengyu Zhang},
title = {Graph Properties and Circular Functions: How Low Can Quantum Query
Complexity Go?},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {286--293},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313851},
doi = {10.1109/CCC.2004.1313851},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/SunYZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TrevisanVZ04,
author = {Luca Trevisan and
Salil P. Vadhan and
David Zuckerman},
title = {Compression of Samplable Sources},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {1--14},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313766},
doi = {10.1109/CCC.2004.1313766},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/TrevisanVZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Wee04,
author = {Hoeteck Wee},
title = {On Pseudoentropy versus Compressibility},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {29--41},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313782},
doi = {10.1109/CCC.2004.1313782},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Wee04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2004,
title = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://ieeexplore.ieee.org/xpl/conhome/9188/proceeding},
isbn = {0-7695-2120-7},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Aaronson03,
author = {Scott Aaronson},
title = {Quantum Certificate Complexity},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {171--178},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214418},
doi = {10.1109/CCC.2003.1214418},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Aaronson03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Agrawal03,
author = {Manindra Agrawal},
title = {On Derandomizing Tests for Certain Polynomial Identities},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {355},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214434},
doi = {10.1109/CCC.2003.1214434},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Agrawal03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderKR03,
author = {Eric Allender and
Michal Kouck{\'{y}} and
Detlef Ronneburger and
Sambuddha Roy},
title = {Derandomization and Distinguishing Complexity},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {209--220},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214421},
doi = {10.1109/CCC.2003.1214421},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderKR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AtseriasD03,
author = {Albert Atserias and
V{\'{\i}}ctor Dalmau},
title = {A Combinatorial Characterization of Resolution Width},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {239--247},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214424},
doi = {10.1109/CCC.2003.1214424},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AtseriasD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BarnumSS03,
author = {Howard Barnum and
Michael E. Saks and
Mario Szegedy},
title = {Quantum query complexity and semi-definite programming},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {179--193},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214419},
doi = {10.1109/CCC.2003.1214419},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BarnumSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeameIPS03,
author = {Paul Beame and
Russell Impagliazzo and
Toniann Pitassi and
Nathan Segerlind},
title = {Memoization and {DPLL:} Formula Caching Proof Systems},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {248},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214425},
doi = {10.1109/CCC.2003.1214425},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BeameIPS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelF03,
author = {Richard Beigel and
Lance Fortnow},
title = {Are Cook and Karp Ever the Same?},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {333--336},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214431},
doi = {10.1109/CCC.2003.1214431},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CalabroIKP03,
author = {Chris Calabro and
Russell Impagliazzo and
Valentine Kabanets and
Ramamohan Paturi},
title = {The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {135},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214416},
doi = {10.1109/CCC.2003.1214416},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CalabroIKP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChakrabartiKS03,
author = {Amit Chakrabarti and
Subhash Khot and
Xiaodong Sun},
title = {Near-Optimal Lower Bounds on the Multi-Party Communication Complexity
of Set Disjointness},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {107--117},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214414},
doi = {10.1109/CCC.2003.1214414},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChakrabartiKS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChenF03,
author = {Yijia Chen and
J{\"{o}}rg Flum and
Martin Grohe},
title = {Bounded Nondeterminism and Alternation in Parameterized Complexity
Theory},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {13--29},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214407},
doi = {10.1109/CCC.2003.1214407},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChenF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/EngebretsenH03,
author = {Lars Engebretsen and
Jonas Holmerin},
title = {Three-Query PCPs with Perfect Completeness over non-Boolean Domains},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {284--299},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214428},
doi = {10.1109/CCC.2003.1214428},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/EngebretsenH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowPS03,
author = {Lance Fortnow and
Aduri Pavan and
Samik Sengupta},
title = {Proving {SAT} does not have Small Circuits with an Application to
the Two},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {347},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214433},
doi = {10.1109/CCC.2003.1214433},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FortnowPS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GlasserSSZ03,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Samik Sengupta and
Liyu Zhang},
title = {Disjoint NP-Pairs},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {313--332},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214430},
doi = {10.1109/CCC.2003.1214430},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GlasserSSZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoyalSV03,
author = {Navin Goyal and
Michael E. Saks and
Srinivasan Venkatesh},
title = {Optimal Separation of {EROW} and CROWPRAMs},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {93},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214413},
doi = {10.1109/CCC.2003.1214413},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoyalSV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Guruswami03,
author = {Venkatesan Guruswami},
title = {List Decoding with Side Information},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {300},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214429},
doi = {10.1109/CCC.2003.1214429},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Guruswami03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Gutfreund03,
author = {Dan Gutfreund and
Ronen Shaltiel and
Amnon Ta{-}Shma},
title = {Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {33--47},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214408},
doi = {10.1109/CCC.2003.1214408},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Gutfreund03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hastad03,
author = {Johan H{\aa}stad},
title = {Inapproximability Some history and some open problems},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {265},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214426},
doi = {10.1109/CCC.2003.1214426},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Hastad03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HolmerinK03,
author = {Jonas Holmerin and
Subhash Khot},
title = {A Strong Inapproximability Gap for a Generalization of Minimum Bisection},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {371--378},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214436},
doi = {10.1109/CCC.2003.1214436},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HolmerinK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoM03,
author = {Russell Impagliazzo and
Philippe Moser},
title = {A zero one law for {RP}},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {48--52},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214409},
doi = {10.1109/CCC.2003.1214409},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KhotR03,
author = {Subhash Khot and
Oded Regev},
title = {Vertex Cover Might be Hard to Approximate to within 2-{\textbackslash}varepsilon},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {379},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214437},
doi = {10.1109/CCC.2003.1214437},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KhotR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Klauck03,
author = {Hartmut Klauck},
title = {Rectangle Size Bounds and Threshold Covers in Communication Complexity},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {118--134},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214415},
doi = {10.1109/CCC.2003.1214415},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Klauck03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Merkle03,
author = {Wolfgang Merkle},
title = {The complexity of stochastic sequences},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {230},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214423},
doi = {10.1109/CCC.2003.1214423},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Merkle03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/NashIR03,
author = {Alan Nash and
Russell Impagliazzo and
Jeffrey B. Remmel},
title = {Universal Languages and the Power of Diagonalization},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {337--346},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214432},
doi = {10.1109/CCC.2003.1214432},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/NashIR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ODonnellS03,
author = {Ryan O'Donnell and
Rocco A. Servedio},
title = {Extremal properties of polynomial threshold functions},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {3--12},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214406},
doi = {10.1109/CCC.2003.1214406},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ODonnellS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Regev03,
author = {Oded Regev},
title = {Improved Inapproximability of Lattice and Coding Problems with Preprocessing},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {363--370},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214435},
doi = {10.1109/CCC.2003.1214435},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Regev03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Romashchenko03,
author = {Andrei E. Romashchenko},
title = {Extracting the Mutual Information for a Triple of Binary Strings},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {221--229},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214422},
doi = {10.1109/CCC.2003.1214422},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Romashchenko03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SanthanamM03,
author = {Rahul Santhanam and
Dieter van Melkebeek},
title = {Holographic Proofs and Derandomization},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {269--283},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.ieeecomputersociety.org/10.1109/COMPLEXITY.2003.10000},
doi = {10.1109/COMPLEXITY.2003.10000},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SanthanamM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Sen03,
author = {Pranab Sen},
title = {Lower bounds for predecessor searching in the cell probe model},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {73--83},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214411},
doi = {10.1109/CCC.2003.1214411},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Sen03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Sieling03,
author = {Detlef Sieling},
title = {Minimization of Decision Trees Is Hard to Approximate},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {84--92},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214412},
doi = {10.1109/CCC.2003.1214412},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Sieling03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Viola03,
author = {Emanuele Viola},
title = {Hardness vs. Randomness within Alternating Time},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {53},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214410},
doi = {10.1109/CCC.2003.1214410},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Viola03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/YangB03,
author = {Ke Yang and
Avrim Blum},
title = {On Statistical Query Sampling and {NMR} Quantum Computing},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {194},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214420},
doi = {10.1109/CCC.2003.1214420},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/YangB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2003,
title = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://ieeexplore.ieee.org/xpl/conhome/8614/proceeding},
isbn = {0-7695-1879-6},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgolHT02,
author = {Ian Agol and
Joel Hass and
William P. Thurston},
title = {3-MANIFOLD {KNOT} {GENUS} is NP-complete},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {24},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004333},
doi = {10.1109/CCC.2002.1004333},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgolHT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Agrawal02,
author = {Manindra Agrawal},
title = {Pseudo-Random Generators and Structure of Complete Degrees},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {139--147},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004349},
doi = {10.1109/CCC.2002.1004349},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Agrawal02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AjtaiKS02,
author = {Mikl{\'{o}}s Ajtai and
Ravi Kumar and
D. Sivakumar},
title = {Sampling Short Lattice Vectors and the Closest Lattice Vector Problem},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {53--57},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004339},
doi = {10.1109/CCC.2002.1004339},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AjtaiKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmbainisSY02,
author = {Andris Ambainis and
Adam D. Smith and
Ke Yang},
title = {Extracting Quantum Entanglement},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {103--112},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004345},
doi = {10.1109/CCC.2002.1004345},
timestamp = {Fri, 05 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AmbainisSY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Bar-YossefJKS02,
author = {Ziv Bar{-}Yossef and
T. S. Jayram and
Ravi Kumar and
D. Sivakumar},
title = {Information Theory Methods in Communication Complexity},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {93--102},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004344},
doi = {10.1109/CCC.2002.1004344},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Bar-YossefJKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Bar-YossefTRS02,
author = {Ziv Bar{-}Yossef and
Luca Trevisan and
Omer Reingold and
Ronen Shaltiel},
title = {Streaming Computation of Combinatorial Objects},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {165--174},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004352},
doi = {10.1109/CCC.2002.1004352},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Bar-YossefTRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BarakG02,
author = {Boaz Barak and
Oded Goldreich},
title = {Universal Arguments and their Applications},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {194--203},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004355},
doi = {10.1109/CCC.2002.1004355},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BarakG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BatuDKR02,
author = {Tugkan Batu and
Sanjoy Dasgupta and
Ravi Kumar and
Ronitt Rubinfeld},
title = {The Complexity of Approximating the Entropy},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {17},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004329},
doi = {10.1109/CCC.2002.1004329},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BatuDKR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeameV02,
author = {Paul Beame and
Erik Vee},
title = {Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor
Problems},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {18},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004330},
doi = {10.1109/CCC.2002.1004330},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BeameV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-Sasson02,
author = {Eli Ben{-}Sasson},
title = {Hard Examples for Bounded Depth Frege},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {4},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004323},
doi = {10.1109/CCC.2002.1004323},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ben-Sasson02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Blaser02,
author = {Markus Bl{\"{a}}ser},
title = {Algebras of Minimal Rank over Perfect Fields},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {113--122},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004346},
doi = {10.1109/CCC.2002.1004346},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Blaser02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CapalboRVW02,
author = {Michael R. Capalbo and
Omer Reingold and
Salil P. Vadhan and
Avi Wigderson},
title = {Randomness Conductors and Constant-Degree Lossless Expanders},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {15},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004327},
doi = {10.1109/CCC.2002.1004327},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CapalboRVW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Dantchev02,
author = {Stefan S. Dantchev},
title = {Resolution Width-Size Trade-offs for the Pigeon-Hole Principle},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {39--43},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004337},
doi = {10.1109/CCC.2002.1004337},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Dantchev02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DeshpandeJKRL02,
author = {Amit Deshpande and
Rahul Jain and
Telikepalli Kavitha and
Jaikumar Radhakrishnan and
Satyanarayana V. Lokam},
title = {Better Lower Bounds for Locally Decodable Codes},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {184--193},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004354},
doi = {10.1109/CCC.2002.1004354},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DeshpandeJKRL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Feige02,
author = {Uriel Feige},
title = {Relations between Average Case Complexity and Approximation Complexity},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {5},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.ieeecomputersociety.org/10.1109/CCC.2002.10006},
doi = {10.1109/CCC.2002.10006},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Feige02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigeM02,
author = {Uriel Feige and
Daniele Micciancio},
title = {The Inapproximability of Lattice and Coding Problems with Preprocessing},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {44--52},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004338},
doi = {10.1109/CCC.2002.1004338},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FeigeM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FischerN02,
author = {Eldar Fischer and
Ilan Newman},
title = {Functions that have Read-Twice Constant Width Branching Programs are
not Necessarily Testable},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {73--79},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004342},
doi = {10.1109/CCC.2002.1004342},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FischerN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Fortnow02,
author = {Lance Fortnow},
title = {The History of Complexity},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {61},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004340},
doi = {10.1109/CCC.2002.1004340},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Fortnow02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoldreichKST02,
author = {Oded Goldreich and
Howard J. Karloff and
Leonard J. Schulman and
Luca Trevisan},
title = {Lower Bounds for Linear Locally Decodable Codes and Private Information
Retrieval},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {175--183},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004353},
doi = {10.1109/CCC.2002.1004353},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoldreichKST02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Green02,
author = {Frederic Green},
title = {The Correlation Between Parity and Quadratic Polynomials Mod 3},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {65--72},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004341},
doi = {10.1109/CCC.2002.1004341},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Green02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiS02,
author = {Venkatesan Guruswami and
Madhu Sudan},
title = {Decoding Concatenated Codes using Soft Information},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {148--157},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004350},
doi = {10.1109/CCC.2002.1004350},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Holmerin02,
author = {Jonas Holmerin},
title = {Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within
2 - {\(\epsilon\)}},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {6},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.ieeecomputersociety.org/10.1109/CCC.2002.10005},
doi = {10.1109/CCC.2002.10005},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Holmerin02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/JacksonKS02,
author = {Jeffrey C. Jackson and
Adam R. Klivans and
Rocco A. Servedio},
title = {Learnability beyond {AC0}},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {26},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004335},
doi = {10.1109/CCC.2002.1004335},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/JacksonKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Khot02,
author = {Subhash Khot},
title = {On the Power of Unique 2-Prover 1-Round Games},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {25},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004334},
doi = {10.1109/CCC.2002.1004334},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Khot02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MeshulamW02,
author = {Roy Meshulam and
Avi Wigderson},
title = {Expanders from Symmetric Codes},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {16},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004328},
doi = {10.1109/CCC.2002.1004328},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/MeshulamW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Micciancio02,
author = {Daniele Micciancio},
title = {Improved Cryptographic Hash Functions with Worst-Case/Average-Case
Connection},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {9},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004324},
doi = {10.1109/CCC.2002.1004324},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Micciancio02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/NayakS02,
author = {Ashwin Nayak and
Julia Salzman},
title = {On Communication over an Entanglement-Assisted Quantum Channel},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {19},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004331},
doi = {10.1109/CCC.2002.1004331},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/NayakS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ODonnell02,
author = {Ryan O'Donnell},
title = {Hardness Amplification within {NP}},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {23},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004332},
doi = {10.1109/CCC.2002.1004332},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ODonnell02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Raz02,
author = {Ran Raz},
title = {Resolution Lower Bounds for the Weak Pigeonhole Principle},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {3},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004322},
doi = {10.1109/CCC.2002.1004322},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Raz02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Razborov02,
author = {Alexander A. Razborov},
title = {Resolution Lower Bounds for Perfect Matching Principles},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {29--38},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004336},
doi = {10.1109/CCC.2002.1004336},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Razborov02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Sivakumar02,
author = {D. Sivakumar},
title = {Algorithmic Derandomization via Complexity Theory},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {10},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004325},
doi = {10.1109/CCC.2002.1004325},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Sivakumar02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TrevisanV02,
author = {Luca Trevisan and
Salil P. Vadhan},
title = {Pseudorandomness and Average-Case Complexity via Uniform Reductions},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {129--138},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004348},
doi = {10.1109/CCC.2002.1004348},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/TrevisanV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Umans02,
author = {Christopher Umans},
title = {Pseudo-Random Generators for All Hardnesses},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {11},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004326},
doi = {10.1109/CCC.2002.1004326},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Umans02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Watrous02,
author = {John Watrous},
title = {Arthur and Merlin in a Quantum World},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {161},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004351},
doi = {10.1109/CCC.2002.1004351},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Watrous02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Winkler02,
author = {Peter Winkler},
title = {Rapid Mixing},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {125},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004347},
doi = {10.1109/CCC.2002.1004347},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Winkler02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Woelfel02,
author = {Philipp Woelfel},
title = {On the Complexity of Integer Multiplication in Branching Programs
with Multiple Tests and in Read-Once Branching Programs with Limited
Nondeterminism},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {80--89},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004343},
doi = {10.1109/CCC.2002.1004343},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Woelfel02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2002,
title = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://ieeexplore.ieee.org/xpl/conhome/7872/proceeding},
isbn = {0-7695-1468-5},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Agrawal01,
author = {Manindra Agrawal},
title = {Towards Uniform AC\({}^{\mbox{0}}\) - Isomorphisms},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {13--20},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933866},
doi = {10.1109/CCC.2001.933866},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Agrawal01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderBH01,
author = {Eric Allender and
David A. Mix Barrington and
William Hesse},
title = {Uniform Circuits for Division: Consequences and Problems},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {150--159},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933882},
doi = {10.1109/CCC.2001.933882},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderBH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderKRRV01,
author = {Eric Allender and
Michal Kouck{\'{y}} and
Detlef Ronneburger and
Sambuddha Roy and
V. Vinay},
title = {Time-Space Tradeoffs in the Counting Hierarchy},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {295--302},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933896},
doi = {10.1109/CCC.2001.933896},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderKRRV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AlonB01,
author = {Noga Alon and
Richard Beigel},
title = {Lower Bounds for Approximations by Low Degree Polynomials Over Z\({}_{\mbox{m}}\)},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {184--187},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933885},
doi = {10.1109/CCC.2001.933885},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AlonB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ambos-SpiesMRS01,
author = {Klaus Ambos{-}Spies and
Wolfgang Merkle and
Jan Reimann and
Frank Stephan},
title = {Hausdorff Dimension in Exponential Time},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {210--217},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933888},
doi = {10.1109/CCC.2001.933888},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ambos-SpiesMRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AntunesFM01,
author = {Luis Antunes and
Lance Fortnow and
Dieter van Melkebeek},
title = {Computational Depth},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {266--273},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933893},
doi = {10.1109/CCC.2001.933893},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AntunesFM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AtseriasGP01,
author = {Albert Atserias and
Nicola Galesi and
Pavel Pudl{\'{a}}k},
title = {Monotone Simulations of Nonmonotone Proofs},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {36--41},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933870},
doi = {10.1109/CCC.2001.933870},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AtseriasGP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeameIS01,
author = {Paul Beame and
Russell Impagliazzo and
Ashish Sabharwal},
title = {Resolution Complexity of Independent Sets in Random Graphs},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {52--68},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933872},
doi = {10.1109/CCC.2001.933872},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BeameIS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeimelI01,
author = {Amos Beimel and
Yuval Ishai},
title = {On the Power of Nonlinear Secrect-Sharing},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {188--202},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933886},
doi = {10.1109/CCC.2001.933886},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeimelI01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-SassonG01,
author = {Eli Ben{-}Sasson and
Nicola Galesi},
title = {Space Complexity of Random Formulae in Resolution},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {42--51},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933871},
doi = {10.1109/CCC.2001.933871},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ben-SassonG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BolligSW01,
author = {Beate Bollig and
Martin Sauerhoff and
Ingo Wegener},
title = {On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times
Branching Programs},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {172--183},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933884},
doi = {10.1109/CCC.2001.933884},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BolligSW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanDHHMSW01,
author = {Harry Buhrman and
Christoph D{\"{u}}rr and
Mark Heiligman and
Peter H{\o}yer and
Fr{\'{e}}d{\'{e}}ric Magniez and
Miklos Santha and
Ronald de Wolf},
title = {Quantum Algorithms for Element Distinctness},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {131--137},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933880},
doi = {10.1109/CCC.2001.933880},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanDHHMSW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanW01,
author = {Harry Buhrman and
Ronald de Wolf},
title = {Communication Complexity Lower Bounds by Polynomials},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {120--130},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933879},
doi = {10.1109/CCC.2001.933879},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChangS01,
author = {Richard Chang and
Jon S. Squire},
title = {Bounded Query Functions with Limited Output Bits},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {90--98},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933876},
doi = {10.1109/CCC.2001.933876},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChangS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Dai01,
author = {Jack Jie Dai},
title = {A Stronger Kolmogorov Zero-One Law for Resource-Bounded Measure},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {204--209},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933887},
doi = {10.1109/CCC.2001.933887},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Dai01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DantchevR01,
author = {Stefan S. Dantchev and
S{\o}ren Riis},
title = {Tree Resolution Proofs of the Weak Pigeon-Hole Principle},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {69--75},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933873},
doi = {10.1109/CCC.2001.933873},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DantchevR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Forster01,
author = {J{\"{u}}rgen Forster},
title = {A Linear Lower Bound on the Unbounded Error Probabilistic Communication
Complexity},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {100--106},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933877},
doi = {10.1109/CCC.2001.933877},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Forster01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Fortnow01,
author = {Lance Fortnow},
title = {Comparing Notions of Full Derandomization},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {28--34},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933869},
doi = {10.1109/CCC.2001.933869},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Fortnow01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Gacs01,
author = {P{\'{e}}ter G{\'{a}}cs},
title = {Quantum Algorithmic Entropy},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {274--283},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933894},
doi = {10.1109/CCC.2001.933894},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Gacs01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HastadW01,
author = {Johan H{\aa}stad and
Avi Wigderson},
title = {Simple Analysis of Graph Tests for Linearity and {PCP}},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {244--254},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933891},
doi = {10.1109/CCC.2001.933891},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HastadW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoKW01,
author = {Russell Impagliazzo and
Valentine Kabanets and
Avi Wigderson},
title = {In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial
Time},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {2--12},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933865},
doi = {10.1109/CCC.2001.933865},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoKW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Koucky01,
author = {Michal Kouck{\'{y}}},
title = {Universal Traversal Sequences with Backtracking},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {21--27},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933868},
doi = {10.1109/CCC.2001.933868},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Koucky01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MosselU01,
author = {Elchanan Mossel and
Christopher Umans},
title = {On the Complexity of Approximating the {VC} Dimension},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {220--225},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933889},
doi = {10.1109/CCC.2001.933889},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/MosselU01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MuchnikV01,
author = {Andrei A. Muchnik and
Nikolai K. Vereshchagin},
title = {Logical Operations and Kolmogorov Complexity {II}},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {256--265},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933892},
doi = {10.1109/CCC.2001.933892},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/MuchnikV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/PavanS01,
author = {Aduri Pavan and
Alan L. Selman},
title = {Separation of NP-Completeness Notions},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {78--89},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933875},
doi = {10.1109/CCC.2001.933875},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/PavanS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Santhanam01,
author = {Rahul Santhanam},
title = {On Separators, Segregators and Time versus Space},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {286--294},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933895},
doi = {10.1109/CCC.2001.933895},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Santhanam01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ServedioG01,
author = {Rocco A. Servedio and
Steven J. Gortler},
title = {Quantum versus Classical Learnability},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {138--148},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933881},
doi = {10.1109/CCC.2001.933881},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ServedioG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Shaltiel01,
author = {Ronen Shaltiel},
title = {Towards Proving Strong Direct Product Theorems},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {107--117},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933878},
doi = {10.1109/CCC.2001.933878},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Shaltiel01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Shpilka01,
author = {Amir Shpilka},
title = {Affine Projections of Symmetric Polynomials},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {160--171},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933883},
doi = {10.1109/CCC.2001.933883},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Shpilka01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/StockmeyerM01,
author = {Larry J. Stockmeyer and
Dharmendra S. Modha},
title = {Links Between Complexity Theory and Constrained Block Coding},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {226--243},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933890},
doi = {10.1109/CCC.2001.933890},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/StockmeyerM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2001,
title = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://ieeexplore.ieee.org/xpl/conhome/7429/proceeding},
isbn = {0-7695-1053-1},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmbainisBGKT00,
author = {Andris Ambainis and
Harry Buhrman and
William I. Gasarch and
Bala Kalyanasundaram and
Leen Torenvliet},
title = {The Communication Complexity of Enumeration, Elimination, and Selection},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {44--53},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856734},
doi = {10.1109/CCC.2000.856734},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AmbainisBGKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BarringtonKLM00,
author = {David A. Mix Barrington and
Peter Kadau and
Klaus{-}J{\"{o}}rn Lange and
Pierre McKenzie},
title = {On the Complexity of Some Problems on Groups Input as Multiplication
Tables},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {62--69},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856736},
doi = {10.1109/CCC.2000.856736},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BarringtonKLM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BerthiaumeDL00,
author = {Andr{\'{e}} Berthiaume and
Wim van Dam and
Sophie Laplante},
title = {Quantum Kolmogorov Complexity},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {240--249},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856755},
doi = {10.1109/CCC.2000.856755},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BerthiaumeDL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanLM00,
author = {Harry Buhrman and
Sophie Laplante and
Peter Bro Miltersen},
title = {New Bounds for the Language Compression Problem},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {126--130},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856742},
doi = {10.1109/CCC.2000.856742},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanLM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Cleve00,
author = {Richard Cleve},
title = {The Query Complexity of Order-Finding},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {54},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856735},
doi = {10.1109/CCC.2000.856735},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Cleve00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DammHM00,
author = {Carsten Damm and
Markus Holzer and
Pierre McKenzie},
title = {The Complexity of Tensor Calculus},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {70--86},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856737},
doi = {10.1109/CCC.2000.856737},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DammHM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DurisHI00,
author = {Pavol Duris and
Juraj Hromkovic and
Katsushi Inoue},
title = {A Separation of Determinism, Las Vegas and Nondeterminism for Picture
Recognition},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {214--228},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856752},
doi = {10.1109/CCC.2000.856752},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DurisHI00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowM00,
author = {Lance Fortnow and
Dieter van Melkebeek},
title = {Time-Space Tradeoffs for Nondeterministic Computation},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {2--13},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856730},
doi = {10.1109/CCC.2000.856730},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FortnowM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Giel00,
author = {Oliver Giel},
title = {BP(L(f)\({}^{\mbox{1+epsilon}}\))},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {36--43},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856733},
doi = {10.1109/CCC.2000.856733},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Giel00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GreenHP00,
author = {Frederic Green and
Steven Homer and
Chris Pollett},
title = {On the Complexity of Quantum {ACC}},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {250--262},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856756},
doi = {10.1109/CCC.2000.856756},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GreenHP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiK00,
author = {Venkatesan Guruswami and
Sanjeev Khanna},
title = {On the Hardness of 4-Coloring a 3-Colorable Graph},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {188--197},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856749},
doi = {10.1109/CCC.2000.856749},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HoangT00,
author = {Thanh Minh Hoang and
Thomas Thierauf},
title = {The Complexity of Verifying the Characteristic Polynomial and Testing
Similarity},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {87},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856738},
doi = {10.1109/CCC.2000.856738},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HoangT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Istrate00,
author = {Gabriel Istrate},
title = {Computational Complexity and Phase Transitions},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {104--115},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856740},
doi = {10.1109/CCC.2000.856740},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Istrate00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/JakobyR00,
author = {Andreas Jakoby and
R{\"{u}}diger Reischuk},
title = {Average Case Complexity of Unbounded Fanin Circuits},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {170},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856748},
doi = {10.1109/CCC.2000.856748},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/JakobyR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Kabanets00,
author = {Valentine Kabanets},
title = {Easiness Assumptions and Hardness Tests: Trading Time for Zero Error},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {150--157},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856746},
doi = {10.1109/CCC.2000.856746},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Kabanets00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KahnSS00,
author = {Jeff Kahn and
Michael E. Saks and
Cliff Smyth},
title = {A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {98--103},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856739},
doi = {10.1109/CCC.2000.856739},
timestamp = {Wed, 09 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KahnSS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KarakostasLV00,
author = {George Karakostas and
Richard J. Lipton and
Anastasios Viglas},
title = {On the Complexity of Intersecting Finite State Automata},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {229--234},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856753},
doi = {10.1109/CCC.2000.856753},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KarakostasLV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Kullmann00,
author = {Oliver Kullmann},
title = {An Application of Matroid Theory to the {SAT} Problem},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {116},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856741},
doi = {10.1109/CCC.2000.856741},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Kullmann00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Lutz00,
author = {Jack H. Lutz},
title = {Dimension in Complexity Classes},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {158--169},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856747},
doi = {10.1109/CCC.2000.856747},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Lutz00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MulmuleyS00,
author = {Ketan Mulmuley and
Pradyut Shah},
title = {A Lower Bound for the Shortest Path Problem},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {14--21},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856731},
doi = {10.1109/CCC.2000.856731},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/MulmuleyS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/RomashchenkoSV00,
author = {Andrei E. Romashchenko and
Alexander Shen and
Nikolai K. Vereshchagin},
title = {Combinatorial Interpretation of Kolmogorov Complexity},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {131--137},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856743},
doi = {10.1109/CCC.2000.856743},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/RomashchenkoSV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Schaefer00,
author = {Marcus Schaefer},
title = {Deciding the K-Dimension is PSPACE-Complete},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {198--203},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856750},
doi = {10.1109/CCC.2000.856750},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Schaefer00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Tourlakis00,
author = {Iannis Tourlakis},
title = {Time-Space Lower Bounds for {SAT} on Uniform and Non-Uniform Machines},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {22},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856732},
doi = {10.1109/CCC.2000.856732},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Tourlakis00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Trevisan00,
author = {Luca Trevisan},
title = {A Survey of Optimal {PCP} Characterizations of {NP}},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {146},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856745},
doi = {10.1109/CCC.2000.856745},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Trevisan00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/VereshchaginV00,
author = {Nikolai K. Vereshchagin and
Michael V. Vyugin},
title = {Independent Minimum Length Programs to Translate between Given Strings},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {138},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856744},
doi = {10.1109/CCC.2000.856744},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/VereshchaginV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Vitanyi00,
author = {Paul M. B. Vit{\'{a}}nyi},
title = {Three Approaches to the Quantitative Definition of Information in
an Individual Pure Quantum State},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {263--270},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856757},
doi = {10.1109/CCC.2000.856757},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Vitanyi00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Voronenko00,
author = {Andrei A. Voronenko},
title = {On the Complexity of the Monotonicity Verification},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {235--238},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856754},
doi = {10.1109/CCC.2000.856754},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Voronenko00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Wolf00,
author = {Ronald de Wolf},
title = {Characterization of Non-Deterministic Quantum Query and Quantum Communication
Complexity},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {271--278},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856758},
doi = {10.1109/CCC.2000.856758},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Wolf00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Yang00,
author = {Ke Yang},
title = {Integer Circuit Evaluation is PSPACE-Complete},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {204},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856751},
doi = {10.1109/CCC.2000.856751},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Yang00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2000,
title = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://ieeexplore.ieee.org/xpl/conhome/6911/proceeding},
isbn = {0-7695-0674-7},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/2000.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderSS99,
author = {Eric Allender and
Michael E. Saks and
Igor E. Shparlinski},
title = {A Lower Bound for Primality},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {10--14},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766257},
doi = {10.1109/CCC.1999.766257},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BabaiL99,
author = {L{\'{a}}szl{\'{o}} Babai and
Sophie Laplante},
title = {Stronger Separations for Random-Self-Reducibility, Rounds, and Advice},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {98--104},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766268},
doi = {10.1109/CCC.1999.766268},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BabaiL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Bar-YossefGW99,
author = {Ziv Bar{-}Yossef and
Oded Goldreich and
Avi Wigderson},
title = {Deterministic Amplification of Space-Bounded Probabilistic Algorithms},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {188},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766276},
doi = {10.1109/CCC.1999.766276},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Bar-YossefGW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BarringtonLMS99,
author = {David A. Mix Barrington and
Chi{-}Jen Lu and
Peter Bro Miltersen and
Sven Skyum},
title = {On Monotone Planar Circuits},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {24},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766259},
doi = {10.1109/CCC.1999.766259},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BarringtonLMS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Beigel99,
author = {Richard Beigel},
title = {Gaps in Bounded Query Hierarchies},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {124--141},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766271},
doi = {10.1109/CCC.1999.766271},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Beigel99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelM99,
author = {Richard Beigel and
Alexis Maciel},
title = {Circuit Lower Bounds Collapse Relativized Complexity Classes},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {222--226},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766280},
doi = {10.1109/CCC.1999.766280},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-SassonW99,
author = {Eli Ben{-}Sasson and
Avi Wigderson},
title = {Short Proofs Are Narrow - Resolution Made Simple (Abstract)},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {2},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766251},
doi = {10.1109/CCC.1999.766251},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ben-SassonW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BonetDGMP99,
author = {Maria Luisa Bonet and
Carlos Domingo and
Ricard Gavald{\`{a}} and
Alexis Maciel and
Toniann Pitassi},
title = {Non-Automatizability of Bounded-Depth Frege Proofs},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {15--23},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766258},
doi = {10.1109/CCC.1999.766258},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BonetDGMP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanD99,
author = {Harry Buhrman and
Wim van Dam},
title = {Quantum Bounded Query Complexity},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {149},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766273},
doi = {10.1109/CCC.1999.766273},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanD99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanT99,
author = {Harry Buhrman and
Leen Torenvliet},
title = {Complicated Complementations},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {227--236},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766281},
doi = {10.1109/CCC.1999.766281},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BussGIP99,
author = {Samuel R. Buss and
Dima Grigoriev and
Russell Impagliazzo and
Toniann Pitassi},
title = {Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct
Primes (Abstract)},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {5},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766254},
doi = {10.1109/CCC.1999.766254},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BussGIP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Cai99,
author = {Jin{-}yi Cai},
title = {Some Recent Progress on the Complexity of Lattice Problems},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {158},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766274},
doi = {10.1109/CCC.1999.766274},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Cai99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Cai99a,
author = {Jin{-}yi Cai},
title = {Applications of a New Transference Theorem to Ajtai's Connection Factor},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {205--214},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766278},
doi = {10.1109/CCC.1999.766278},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Cai99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DaiL99,
author = {Jack Jie Dai and
Jack H. Lutz},
title = {Query Order and NP-Completeness},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {142--148},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766272},
doi = {10.1109/CCC.1999.766272},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DaiL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GalHLP99,
author = {Anna G{\'{a}}l and
Shai Halevi and
Richard J. Lipton and
Erez Petrank},
title = {Computing from Partial Solutions},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {34--45},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766260},
doi = {10.1109/CCC.1999.766260},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GalHLP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoldmannR99,
author = {Mikael Goldmann and
Alexander Russell},
title = {The Complexity of Solving Equations over Finite Groups},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {80--86},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766266},
doi = {10.1109/CCC.1999.766266},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoldmannR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoldreichV99,
author = {Oded Goldreich and
Salil P. Vadhan},
title = {Comparing Entropies in Statistical Zero Knowledge with Applications
to the Structure of {SZK}},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {54},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766262},
doi = {10.1109/CCC.1999.766262},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoldreichV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImpagliazzoP99,
author = {Russell Impagliazzo and
Ramamohan Paturi},
title = {Complexity of k-SAT},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {237--240},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766282},
doi = {10.1109/CCC.1999.766282},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ImpagliazzoP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/JiangLV99,
author = {Tao Jiang and
Ming Li and
Paul M. B. Vit{\'{a}}nyi},
title = {The Expected Size of Heilbronn's Triangles},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {105--113},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766269},
doi = {10.1109/CCC.1999.766269},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/JiangLV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KumarS99,
author = {Ravi Kumar and
D. Sivakumar},
title = {Proofs, Codes, and Polynomial-Time Reducibilities},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {46--53},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766261},
doi = {10.1109/CCC.1999.766261},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KumarS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KumarS99a,
author = {Ravi Kumar and
D. Sivakumar},
title = {A Note on the Shortest Lattice Vector Problem},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {200--204},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766277},
doi = {10.1109/CCC.1999.766277},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KumarS99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MuchnikRSV99,
author = {Andrei A. Muchnik and
Andrei E. Romashchenko and
Alexander Shen and
Nikolai K. Vereshchagin},
title = {Upper Semilattice of Binary Strings with the Relation "x is Simple
Conditional to y"},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {114},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766270},
doi = {10.1109/CCC.1999.766270},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/MuchnikRSV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/PonzioRV99,
author = {Stephen Ponzio and
Jaikumar Radhakrishnan and
Srinivasan Venkatesh},
title = {The Communication Complexity of Pointer Chasing Applications of Entropy
and Sampling (Abstract)},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {7},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766256},
doi = {10.1109/CCC.1999.766256},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/PonzioRV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Rojas99,
author = {J. Maurice Rojas},
title = {On the Complexity of Diophantine Geometry in Low Dimensions (Abstract)},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {3},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766252},
doi = {10.1109/CCC.1999.766252},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Rojas99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Schaefer99,
author = {Marcus Schaefer},
title = {Graph Ramsey Theory and the Polynomial Hierarchy (Abstract)},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {6},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766255},
doi = {10.1109/CCC.1999.766255},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Schaefer99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ShpilkaW99,
author = {Amir Shpilka and
Avi Wigderson},
title = {Depth-3 Arithmetic Formulae over Fields of Characteristic Zero},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {87},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766267},
doi = {10.1109/CCC.1999.766267},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ShpilkaW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SudanTV99,
author = {Madhu Sudan and
Luca Trevisan and
Salil P. Vadhan},
title = {Pseudorandom Generators without the {XOR} Lemma (Abstract)},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {4},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766253},
doi = {10.1109/CCC.1999.766253},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SudanTV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TaruiT99,
author = {Jun Tarui and
Tatsuie Tsukiji},
title = {Learning {DNF} by Approximating Inclusion-Exclusion Formulae},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {215},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766279},
doi = {10.1109/CCC.1999.766279},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/TaruiT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Watrous99,
author = {John Watrous},
title = {Quantum Simulations of Classical Random Walks and Undirected Graph
Connectivity},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {180--187},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766275},
doi = {10.1109/CCC.1999.766275},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Watrous99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Wigderson99,
author = {Avi Wigderson},
title = {De-Randomizing {BPP:} The State of the Art},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {76},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766263},
doi = {10.1109/CCC.1999.766263},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Wigderson99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/1999,
title = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://ieeexplore.ieee.org/xpl/conhome/6217/proceeding},
isbn = {0-7695-0075-7},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/1999.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalT98,
author = {Manindra Agrawal and
Thomas Thierauf},
title = {The Satisfiability Problem for Probabilistic Ordered Branching Programs},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {81},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694593},
doi = {10.1109/CCC.1998.694593},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderR98,
author = {Eric Allender and
Klaus Reinhardt},
title = {Isolation, Matching, and Counting},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {92--100},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694594},
doi = {10.1109/CCC.1998.694594},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelF98,
author = {Richard Beigel and
Bin Fu},
title = {Solving Intractable Problems with {DNA} Computing},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {154},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694601},
doi = {10.1109/CCC.1998.694601},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelF98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeimelG98,
author = {Amos Beimel and
Anna G{\'{a}}l},
title = {On Arithmetic Branching Programs},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {68--80},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694592},
doi = {10.1109/CCC.1998.694592},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeimelG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanF98,
author = {Harry Buhrman and
Lance Fortnow},
title = {Two Queries},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {13},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694586},
doi = {10.1109/CCC.1998.694586},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanF98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanFT98,
author = {Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
title = {Nonrelativizing Separations},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {8--12},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694585},
doi = {10.1109/CCC.1998.694585},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanFT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanM98,
author = {Harry Buhrman and
Dieter van Melkebeek},
title = {Hard Sets are Hard to Find},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {170--181},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694602},
doi = {10.1109/CCC.1998.694602},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanT98,
author = {Harry Buhrman and
Leen Torenvliet},
title = {Randomness is Hard},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {249--260},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694616},
doi = {10.1109/CCC.1998.694616},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CaiN98,
author = {Jin{-}yi Cai and
Ajay Nerurkar},
title = {Approximating the {SVP} to within a Factor is NP-Hard under Randomized
Reductions},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {46},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694590},
doi = {10.1109/CCC.1998.694590},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CaiN98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CrescenzoI98,
author = {Giovanni Di Crescenzo and
Russell Impagliazzo},
title = {Proofs of Membership vs. Proofs of Knowledge},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {34--45},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694589},
doi = {10.1109/CCC.1998.694589},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CrescenzoI98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DowneyF98,
author = {Rodney G. Downey and
Lance Fortnow},
title = {Uniformly Hard Languages},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {228},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694610},
doi = {10.1109/CCC.1998.694610},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DowneyF98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowR98,
author = {Lance Fortnow and
John D. Rogers},
title = {Complexity Limitations on Quantum Computation},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {202--209},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694606},
doi = {10.1109/CCC.1998.694606},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FortnowR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoldreichS98,
author = {Oded Goldreich and
Madhu Sudan},
title = {Computational Indistinguishability: {A} Sample Hierarchy},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {24--33},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694588},
doi = {10.1109/CCC.1998.694588},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoldreichS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoldsmithM98,
author = {Judy Goldsmith and
Martin Mundhenk},
title = {Complexity Issues in Markov Decision Processes},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {272--280},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694621},
doi = {10.1109/CCC.1998.694621},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoldsmithM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/JennerMT98,
author = {Birgit Jenner and
Pierre McKenzie and
Jacobo Tor{\'{a}}n},
title = {A Note on the Hardness of Tree Isomorphism},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {101--105},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694595},
doi = {10.1109/CCC.1998.694595},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/JennerMT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Klauck98,
author = {Hartmut Klauck},
title = {Lower Bounds for Computation with Limited Nondeterminism},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {141},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694600},
doi = {10.1109/CCC.1998.694600},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Klauck98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KoblerL98,
author = {Johannes K{\"{o}}bler and
Wolfgang Lindner},
title = {On the Resource Bounded Measure of P/poly},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {182--185},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694603},
doi = {10.1109/CCC.1998.694603},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KoblerL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KoblerM98,
author = {Johannes K{\"{o}}bler and
Jochen Messner},
title = {Complete Problems for Promise Classes by Optimal Proof Systems for
Test Sets},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {132--140},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694599},
doi = {10.1109/CCC.1998.694599},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KoblerM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LindnerSW98,
author = {Wolfgang Lindner and
Rainer Schuler and
Osamu Watanabe},
title = {Resource Bounded Measure and Learnability},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {261},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694620},
doi = {10.1109/CCC.1998.694620},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LindnerSW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Lutz98,
author = {Jack H. Lutz},
title = {Resource-Bounded Measure},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {236--248},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694611},
doi = {10.1109/CCC.1998.694611},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Lutz98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MaratheHRS98,
author = {Madhav V. Marathe and
Harry B. Hunt III and
Daniel J. Rosenkrantz and
Richard Edwin Stearns},
title = {Theory of Periodically Specified Problems: Complexity and Approximability},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {106},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694596},
doi = {10.1109/CCC.1998.694596},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/MaratheHRS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/RazTVV98,
author = {Ran Raz and
G{\'{a}}bor Tardos and
Oleg Verbitsky and
Nikolai K. Vereshchagin},
title = {Arthur-Merlin Games in Boolean Decision Trees},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {58--67},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694591},
doi = {10.1109/CCC.1998.694591},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/RazTVV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ReganS98,
author = {Kenneth W. Regan and
D. Sivakumar},
title = {Probabilistic Martingales and {BPTIME} Classes},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {186},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694604},
doi = {10.1109/CCC.1998.694604},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ReganS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Sivakumar98,
author = {D. Sivakumar},
title = {On Membership Comparable Sets},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {2--7},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694584},
doi = {10.1109/CCC.1998.694584},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Sivakumar98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Spielman98,
author = {Daniel A. Spielman},
title = {Models of Computation in Coding Theory},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {120},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694597},
doi = {10.1109/CCC.1998.694597},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Spielman98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Veith98,
author = {Helmut Veith},
title = {How to Encode a Logical Structure by an {OBDD}},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {122--131},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694598},
doi = {10.1109/CCC.1998.694598},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Veith98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Watrous98,
author = {John Watrous},
title = {Relationships Between Quantum and Classical Space-Bounded Complexity
Classes},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {210--227},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694607},
doi = {10.1109/CCC.1998.694607},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Watrous98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/1998,
title = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://ieeexplore.ieee.org/xpl/conhome/5641/proceeding},
isbn = {0-8186-8395-3},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/1998.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalAD97,
author = {Manindra Agrawal and
Eric Allender and
Samir Datta},
title = {On TC\({}^{\mbox{0}}\), AC\({}^{\mbox{0}}\), and Arithmetic Circuits},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {134--148},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612309},
doi = {10.1109/CCC.1997.612309},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalAD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ambos-SpiesB97,
author = {Klaus Ambos{-}Spies and
Levke Bentzien},
title = {Separating NP-Completeness Notions under Strong Hypotheses},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {121--127},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612307},
doi = {10.1109/CCC.1997.612307},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ambos-SpiesB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ArvindT97,
author = {Vikraman Arvind and
Jacobo Tor{\'{a}}n},
title = {A Nonadaptive {NC} Checker for Permutation Group Intersection},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {204--212},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612316},
doi = {10.1109/CCC.1997.612316},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ArvindT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BabaiK97,
author = {L{\'{a}}szl{\'{o}} Babai and
Peter G. Kimmel},
title = {Randomized Simultaneous Messages: Solution of a Problem of Yao in
Communication Complexity},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {239--246},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612319},
doi = {10.1109/CCC.1997.612319},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BabaiK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelF97,
author = {Richard Beigel and
Bin Fu},
title = {Circuits Over {PP} and {PL}},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {24--35},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612297},
doi = {10.1109/CCC.1997.612297},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelF97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelM97,
author = {Richard Beigel and
Alexis Maciel},
title = {Upper and Lower Bounds for Some Depth-3 Circuit Classes},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {149--157},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612310},
doi = {10.1109/CCC.1997.612310},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BergU97,
author = {Christer Berg and
Staffan Ulfberg},
title = {A Lower Bound for Perceptrons and an Oracle Separation of the PP\({}^{\mbox{PH}}\)
Hierarchy},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {165--172},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612312},
doi = {10.1109/CCC.1997.612312},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BergU97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BermanDLMT97,
author = {Joshua Berman and
Arthur Drisko and
Fran{\c{c}}ois Lemieux and
Cristopher Moore and
Denis Th{\'{e}}rien},
title = {Circuits and Expressions with NOn-Associative Gates},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {193--203},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612315},
doi = {10.1109/CCC.1997.612315},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BermanDLMT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BorchertS97,
author = {Bernd Borchert and
Riccardo Silvestri},
title = {The General Notion of a Dot-Operator},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {36--44},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612298},
doi = {10.1109/CCC.1997.612298},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BorchertS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BorodinE97,
author = {Allan Borodin and
Ran El{-}Yaniv},
title = {On Ranomization in Online Computation},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {226--238},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612318},
doi = {10.1109/CCC.1997.612318},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BorodinE97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanFT97,
author = {Harry Buhrman and
Lance Fortnow and
Leen Torenvliet},
title = {Six Hypotheses in Search of a Theorem},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {2--12},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612295},
doi = {10.1109/CCC.1997.612295},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanFT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CaiCH97,
author = {Liming Cai and
Jianer Chen and
Johan H{\aa}stad},
title = {Circuit Bottom Fan-in and Computational Power},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {158--164},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612311},
doi = {10.1109/CCC.1997.612311},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CaiCH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChenFZ97,
author = {Jianer Chen and
Donald K. Friesen and
Hao Zheng},
title = {Tight Bound on Johnson's Algoritihm for Max-SAT},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {274--281},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612322},
doi = {10.1109/CCC.1997.612322},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChenFZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Crescenzi97,
author = {Pierluigi Crescenzi},
title = {A Short Guide to Approximation Preserving Reductions},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {262--273},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612321},
doi = {10.1109/CCC.1997.612321},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Crescenzi97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DantsinEGV97,
author = {Evgeny Dantsin and
Thomas Eiter and
Georg Gottlob and
Andrei Voronkov},
title = {Complexity and Expressive Power of Logic Programming},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {82--101},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612304},
doi = {10.1109/CCC.1997.612304},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/DantsinEGV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DowneyN97,
author = {Rodney G. Downey and
Andr{\'{e}} Nies},
title = {Undecidability Results for Low Complexity Degree Structures},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {128--132},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612308},
doi = {10.1109/CCC.1997.612308},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DowneyN97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FennerHPS97,
author = {Stephen A. Fenner and
Steven Homer and
Randall Pruim and
Marcus Schaefer},
title = {Hyper-Polynomial Hierarchies and the NP-Jump},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {102--110},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612305},
doi = {10.1109/CCC.1997.612305},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FennerHPS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Fortnow97,
author = {Lance Fortnow},
title = {Nondeterministic Polynomial Time versus Nondeterministic Logarithmic
Space: Time-Space Tradeoffs for Satisfiability},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {52--60},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612300},
doi = {10.1109/CCC.1997.612300},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Fortnow97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HammerRSV97,
author = {Daniel Hammer and
Andrei E. Romashchenko and
Alexander Shen and
Nikolai K. Vereshchagin},
title = {Inequalities for Shannon entropies and Kolmogorov complexities},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {13--23},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612296},
doi = {10.1109/CCC.1997.612296},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HammerRSV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hertrampf97,
author = {Ulrich Hertrampf},
title = {Acceptance by Transformation Monoids (with an Application to Local
Self Reductions)},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {213--224},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612317},
doi = {10.1109/CCC.1997.612317},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Hertrampf97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HinrichsW97,
author = {Maren Hinrichs and
Gerd Wechsung},
title = {Time Bounded Frequency Computations},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {185--192},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612314},
doi = {10.1109/CCC.1997.612314},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HinrichsW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Jukna97,
author = {Stasys Jukna},
title = {Finite Limits and Monotone Computations: The Lower Bounds Criterion},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {302--313},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612325},
doi = {10.1109/CCC.1997.612325},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Jukna97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Karg97,
author = {Christoph Karg},
title = {LR(k) Testing is Average Case Complete},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {74--80},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612303},
doi = {10.1109/CCC.1997.612303},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Karg97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KhannaST97,
author = {Sanjeev Khanna and
Madhu Sudan and
Luca Trevisan},
title = {Constraint Satisfaction: The Approximability of Minimization Problems},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {282--296},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612323},
doi = {10.1109/CCC.1997.612323},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KhannaST97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LangeMT97,
author = {Klaus{-}J{\"{o}}rn Lange and
Pierre McKenzie and
Alain Tapp},
title = {Reversible Space Equals Deterministic Space},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {45--50},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612299},
doi = {10.1109/CCC.1997.612299},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LangeMT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LutzZ97,
author = {Jack H. Lutz and
Yong Zhao},
title = {The Density of Weakly Complete Problems under Adaptive Reductions},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {111--120},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612306},
doi = {10.1109/CCC.1997.612306},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LutzZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Regan97,
author = {Kenneth W. Regan},
title = {Polynomial Vicinity Circuits and Nonlinear Lower Bounds},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {61--68},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612301},
doi = {10.1109/CCC.1997.612301},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Regan97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Schuler97,
author = {Rainer Schuler},
title = {A Note on Universal Distributions for Polynomial-Time Computable Distributions},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {69--73},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612302},
doi = {10.1109/CCC.1997.612302},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Schuler97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SimonT97,
author = {Janos Simon and
Shi{-}Chun Tsai},
title = {A Note on the Bottleneck Counting Argument},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {297--301},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612324},
doi = {10.1109/CCC.1997.612324},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SimonT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TardosZ97,
author = {G{\'{a}}bor Tardos and
Uri Zwick},
title = {The Communication Complexity of the Universal Relation},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {247--259},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612320},
doi = {10.1109/CCC.1997.612320},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/TardosZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/VollmerW97,
author = {Heribert Vollmer and
Klaus W. Wagner},
title = {On Operators of Higher Types},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {174--184},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612313},
doi = {10.1109/CCC.1997.612313},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/VollmerW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/1997,
title = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://ieeexplore.ieee.org/xpl/conhome/4843/proceeding},
isbn = {0-8186-7907-7},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/1997.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalA96,
author = {Manindra Agrawal and
Eric Allender},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {An Isomorphism Theorem for Circuit Complexity},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {2--11},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507663},
doi = {10.1109/CCC.1996.507663},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalA96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalA96a,
author = {Manindra Agrawal and
Vikraman Arvind},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {A Note on Decision versus Search for Graph Automorphism},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {272--277},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507689},
doi = {10.1109/CCC.1996.507689},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalA96a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ambos-SpiesMZ96,
author = {Klaus Ambos{-}Spies and
Elvira Mayordomo and
Xizhong Zheng},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {A Comparison of Weak Completeness Notions},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {171--178},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507679},
doi = {10.1109/CCC.1996.507679},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ambos-SpiesMZ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BachCGT96,
author = {Eric Bach and
Anne Condon and
Elton Glaser and
Celena Tanguay},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {{DNA} Models and Algorithms for NP-complete Problems},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {290--300},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507691},
doi = {10.1109/CCC.1996.507691},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BachCGT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BarlandKT96,
author = {Ian Barland and
Phokion G. Kolaitis and
Madhukar N. Thakur},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Integer Programming as a Framework for Optimization and Approximability},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {249--259},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507687},
doi = {10.1109/CCC.1996.507687},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BarlandKT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BussP96,
author = {Samuel R. Buss and
Toniann Pitassi},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Good Degree Bounds on Nullstellensatz Refutations of the Induction
Principle},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {233--242},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507685},
doi = {10.1109/CCC.1996.507685},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BussP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CaussinusMTV96,
author = {Herv{\'{e}} Caussinus and
Pierre McKenzie and
Denis Th{\'{e}}rien and
Heribert Vollmer},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Nondeterministic NC\({}^{\mbox{1}}\) Computation},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {12--21},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507664},
doi = {10.1109/CCC.1996.507664},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/CaussinusMTV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigeK96,
author = {Uriel Feige and
Joe Kilian},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Zero Knowledge and the Chromatic Number},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {278--287},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507690},
doi = {10.1109/CCC.1996.507690},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FeigeK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigeV96,
author = {Uriel Feige and
Oleg Verbitsky},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Error Reduction by Parallel Repetition - a Negative Result},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {70--76},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507669},
doi = {10.1109/CCC.1996.507669},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FeigeV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigenbaumFLN96,
author = {Joan Feigenbaum and
Lance Fortnow and
Sophie Laplante and
Ashish V. Naik},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {On Coherence, Random-self-reducibility, and Self-correction},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {59--67},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507668},
doi = {10.1109/CCC.1996.507668},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FeigenbaumFLN96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FennerFNR96,
author = {Stephen A. Fenner and
Lance Fortnow and
Ashish V. Naik and
John D. Rogers},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Inverting Onto Functions},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {213--222},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507683},
doi = {10.1109/CCC.1996.507683},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FennerFNR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FennerGHSTV96,
author = {Stephen A. Fenner and
Frederic Green and
Steven Homer and
Alan L. Selman and
Thomas Thierauf and
Heribert Vollmer},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Complements of Multivalued Functions},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {260--269},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507688},
doi = {10.1109/CCC.1996.507688},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FennerGHSTV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowGM96,
author = {Lance Fortnow and
Judy Goldsmith and
Stephen R. Mahaney},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {L-Printable Sets},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {97--106},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507673},
doi = {10.1109/CCC.1996.507673},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FortnowGM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Gottlob96,
author = {Georg Gottlob},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Collapsing Oracle-Tape Hierarchies},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {33--42},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507666},
doi = {10.1109/CCC.1996.507666},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Gottlob96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/IwamaI96,
author = {Kazuo Iwama and
Chuzo Iwamoto},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform
Circuits},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {24--32},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507665},
doi = {10.1109/CCC.1996.507665},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/IwamaI96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KoW96,
author = {Ker{-}I Ko and
Klaus Weihrauch},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {On the Measure of Two-Dimensional Regions with Polynomial-Time computables
Boundaries},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {150--159},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507677},
doi = {10.1109/CCC.1996.507677},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KoW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Koiran96,
author = {Pascal Koiran},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {{VC} Dimension in Circuit Complexity},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {81--85},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507671},
doi = {10.1109/CCC.1996.507671},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Koiran96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LautemannSS96,
author = {Clemens Lautemann and
Thomas Schwentick and
Iain A. Stewart},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {On Positive {P}},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {162--170},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507678},
doi = {10.1109/CCC.1996.507678},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LautemannSS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LiV96,
author = {Ming Li and
Paul M. B. Vit{\'{a}}nyi},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Reversible Simulation of Irreversible Computation},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {301--306},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507692},
doi = {10.1109/CCC.1996.507692},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/LiV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Melkebeek96,
author = {Dieter van Melkebeek},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Reducing {P} to a Sparse Set using a Constant Number of Queries Collapses
{P} to {L}},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {88--96},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507672},
doi = {10.1109/CCC.1996.507672},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Melkebeek96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/NaikS96,
author = {Ashish V. Naik and
Alan L. Selman},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {A Note on P-selective sets and on Adaptive versus Nonadaptive Queries
to {NP}},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {224--232},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507684},
doi = {10.1109/CCC.1996.507684},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/NaikS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Nisan96,
author = {Noam Nisan},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Extracting Randomness: How and Why {A} survey},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {44--58},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507667},
doi = {10.1109/CCC.1996.507667},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Nisan96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Papadimitriou96,
author = {Christos H. Papadimitriou},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {The Complexity of Knowledge Representation},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {244--248},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507686},
doi = {10.1109/CCC.1996.507686},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Papadimitriou96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Saks96,
author = {Michael E. Saks},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Randomization and Derandomization in Space{\_}Bounded Computation},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {128--149},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507676},
doi = {10.1109/CCC.1996.507676},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Saks96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Schafer96,
author = {Marcus Sch{\"{a}}fer},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Deciding the Vapnik-Cervonenkis dimension is Sigma\({}^{\mbox{P}}\)\({}_{\mbox{3}}\)-complete},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {77--80},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507670},
doi = {10.1109/CCC.1996.507670},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Schafer96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Schuler96,
author = {Rainer Schuler},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Truth-table Closure and Turing Closure of Average Polynomial Time
have Different Measures in {EXP}},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {190--195},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507681},
doi = {10.1109/CCC.1996.507681},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Schuler96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Selman96,
author = {Alan L. Selman},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Much Ado about Functions},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {198--212},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507682},
doi = {10.1109/CCC.1996.507682},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Selman96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Veith96,
author = {Helmut Veith},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Succinct Representation, Leaf Languages, and Projection Reductions},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {118--126},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507675},
doi = {10.1109/CCC.1996.507675},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Veith96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Vinay96,
author = {V. Vinay},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Hierarchies of Circuit Classes that are Closed under Complement},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {108--117},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507674},
doi = {10.1109/CCC.1996.507674},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Vinay96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Wang96,
author = {Yongge Wang},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {The Law of the Iterated Logarithm for p-Random Sequences},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {180--189},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507680},
doi = {10.1109/CCC.1996.507680},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Wang96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/1996,
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://ieeexplore.ieee.org/xpl/conhome/3765/proceeding},
isbn = {0-8186-7386-9},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/1996.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgarwalC95,
author = {Sameet Agarwal and
Anne Condon},
title = {On Approximation Algorithms for Hierarchical {MAX-SAT}},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {214--226},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514860},
doi = {10.1109/SCT.1995.514860},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgarwalC95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Agrawal95,
author = {Manindra Agrawal},
title = {DSPACE(n)=\({}^{\mbox{?}}\)NSPACE(n): {A} Degree Theoretic Characterization},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {315--323},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514869},
doi = {10.1109/SCT.1995.514869},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Agrawal95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalA95,
author = {Manindra Agrawal and
Vikraman Arvind},
title = {Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit
Classes, and Sparse Sets},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {264--276},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514865},
doi = {10.1109/SCT.1995.514865},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalA95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ambos-Spies95,
author = {Klaus Ambos{-}Spies},
title = {Resource-Bounded Genericity},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {162--181},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514855},
doi = {10.1109/SCT.1995.514855},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ambos-Spies95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BalcazarM95,
author = {Jos{\'{e}} L. Balc{\'{a}}zar and
Elvira Mayordomo},
title = {A Note on Genericity and Bi-Immunity},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {193--196},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514857},
doi = {10.1109/SCT.1995.514857},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BalcazarM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelGK95,
author = {Richard Beigel and
William I. Gasarch and
Efim B. Kinber},
title = {Frequency Computation and Bounded Queries},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {125--132},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514852},
doi = {10.1109/SCT.1995.514852},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelGK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelS95,
author = {Richard Beigel and
Howard Straubing},
title = {The Power of Local Self-Reductions},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {277--285},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514866},
doi = {10.1109/SCT.1995.514866},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-AsherN95,
author = {Yosi Ben{-}Asher and
Ilan Newman},
title = {Decision Trees with AND, {OR} Queries},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {74--81},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514729},
doi = {10.1109/SCT.1995.514729},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ben-AsherN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanM95,
author = {Harry Buhrman and
Elvira Mayordomo},
title = {An Excursion to the Kolmogorov Random Strings},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {197--203},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514858},
doi = {10.1109/SCT.1995.514858},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChangGT95,
author = {Richard Chang and
William I. Gasarch and
Jacobo Tor{\'{a}}n},
title = {On Finding the Number of Graph Automorphisms},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {288--298},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514867},
doi = {10.1109/SCT.1995.514867},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChangGT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Etessami95,
author = {Kousha Etessami},
title = {Counting Quantifiers, Successor Relations, and Logarithmic Space},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {2--11},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514723},
doi = {10.1109/SCT.1995.514723},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Etessami95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FeigenbaumKS95,
author = {Joan Feigenbaum and
Daphne Koller and
Peter W. Shor},
title = {A Game-Theoretic Classification of Interactive Complexity Classes},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {227--237},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514861},
doi = {10.1109/SCT.1995.514861},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FeigenbaumKS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Fenner95,
author = {Stephen A. Fenner},
title = {Inverting the Turing Jump in Complexity Theory},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {102--110},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514732},
doi = {10.1109/SCT.1995.514732},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Fenner95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Fenner95a,
author = {Stephen A. Fenner},
title = {Resource-Bounded Baire Category: {A} Stronger Approach},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {182--192},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514856},
doi = {10.1109/SCT.1995.514856},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Fenner95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Gal95,
author = {Anna G{\'{a}}l},
title = {Semi-Unbounded Fan-In Circuits: Boolean vs. Arithmetic},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {82--87},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514730},
doi = {10.1109/SCT.1995.514730},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Gal95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GalS95,
author = {Anna G{\'{a}}l and
Mario Szegedy},
title = {Fault Tolerant Circuits and Probabilistically Checkable Proofs},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {65--73},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514728},
doi = {10.1109/SCT.1995.514728},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GalS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HanT95,
author = {Yenjo Han and
Thomas Thierauf},
title = {Restricted Information from Nonadaptive Queries to {NP}},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {206--213},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514859},
doi = {10.1109/SCT.1995.514859},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HanT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HertrampfVW95,
author = {Ulrich Hertrampf and
Heribert Vollmer and
Klaus W. Wagner},
title = {On the Power of Number-Theoretic Operations with Respect to Counting},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {299--314},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514868},
doi = {10.1109/SCT.1995.514868},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HertrampfVW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Impagliazzo95,
author = {Russell Impagliazzo},
title = {A Personal View of Average-Case Complexity},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {134--147},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514853},
doi = {10.1109/SCT.1995.514853},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Impagliazzo95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/IwamaM95,
author = {Kazuo Iwama and
Eiji Miyano},
title = {Intractability of Read-Once Resolution},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {29--36},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514725},
doi = {10.1109/SCT.1995.514725},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/IwamaM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-07-17 06:41 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
