Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/coco/coco2023.bht:"
@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} }
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.