Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/coco/coco2021.bht:"
download as .bib file
@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}
}
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-06-11 01:13 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:
