35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 1-1068, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@Proceedings{saraf:LIPIcs.CCC.2020, title = {{LIPIcs, Volume 169, CCC 2020, Complete Volume}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {1--1068}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020}, URN = {urn:nbn:de:0030-drops-125518}, doi = {10.4230/LIPIcs.CCC.2020}, annote = {Keywords: LIPIcs, Volume 169, CCC 2020, Complete Volume} }
35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 0:i-0:xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{saraf:LIPIcs.CCC.2020.0, author = {Saraf, Shubhangi}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.0}, URN = {urn:nbn:de:0030-drops-125520}, doi = {10.4230/LIPIcs.CCC.2020.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Avraham Ben-Aroya, Dean Doron, and Amnon Ta-Shma. Near-Optimal Erasure List-Decodable Codes. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 1:1-1:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{benaroya_et_al:LIPIcs.CCC.2020.1, author = {Ben-Aroya, Avraham and Doron, Dean and Ta-Shma, Amnon}, title = {{Near-Optimal Erasure List-Decodable Codes}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {1:1--1:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.1}, URN = {urn:nbn:de:0030-drops-125531}, doi = {10.4230/LIPIcs.CCC.2020.1}, annote = {Keywords: Dispersers, Erasure codes, List decoding, Ramsey graphs, Two-source extractors} }
Prerona Chatterjee, Mrinal Kumar, Adrian She, and Ben Lee Volk. A Quadratic Lower Bound for Algebraic Branching Programs. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 2:1-2:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chatterjee_et_al:LIPIcs.CCC.2020.2, author = {Chatterjee, Prerona and Kumar, Mrinal and She, Adrian and Volk, Ben Lee}, title = {{A Quadratic Lower Bound for Algebraic Branching Programs}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {2:1--2:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.2}, URN = {urn:nbn:de:0030-drops-125546}, doi = {10.4230/LIPIcs.CCC.2020.2}, annote = {Keywords: Algebraic Branching Programs, Lower Bound} }
Dominik Scheder and Navid Talebanfard. Super Strong ETH Is True for PPSZ with Small Resolution Width. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 3:1-3:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{scheder_et_al:LIPIcs.CCC.2020.3, author = {Scheder, Dominik and Talebanfard, Navid}, title = {{Super Strong ETH Is True for PPSZ with Small Resolution Width}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {3:1--3:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.3}, URN = {urn:nbn:de:0030-drops-125552}, doi = {10.4230/LIPIcs.CCC.2020.3}, annote = {Keywords: k-SAT, PPSZ, Resolution} }
Jin-Yi Cai, Tianyu Liu, Pinyan Lu, and Jing Yu. Approximability of the Eight-Vertex Model. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 4:1-4:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cai_et_al:LIPIcs.CCC.2020.4, author = {Cai, Jin-Yi and Liu, Tianyu and Lu, Pinyan and Yu, Jing}, title = {{Approximability of the Eight-Vertex Model}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {4:1--4:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.4}, URN = {urn:nbn:de:0030-drops-125564}, doi = {10.4230/LIPIcs.CCC.2020.4}, annote = {Keywords: Approximate complexity, the eight-vertex model, Markov chain Monte Carlo} }
Mrinal Kumar and Ben Lee Volk. Lower Bounds for Matrix Factorization. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 5:1-5:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kumar_et_al:LIPIcs.CCC.2020.5, author = {Kumar, Mrinal and Volk, Ben Lee}, title = {{Lower Bounds for Matrix Factorization}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {5:1--5:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.5}, URN = {urn:nbn:de:0030-drops-125578}, doi = {10.4230/LIPIcs.CCC.2020.5}, annote = {Keywords: Algebraic Complexity, Linear Circuits, Matrix Factorization, Lower Bounds} }
Dean Doron, Pooya Hatami, and William M. Hoza. Log-Seed Pseudorandom Generators via Iterated Restrictions. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 6:1-6:36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{doron_et_al:LIPIcs.CCC.2020.6, author = {Doron, Dean and Hatami, Pooya and Hoza, William M.}, title = {{Log-Seed Pseudorandom Generators via Iterated Restrictions}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {6:1--6:36}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.6}, URN = {urn:nbn:de:0030-drops-125586}, doi = {10.4230/LIPIcs.CCC.2020.6}, annote = {Keywords: Pseudorandom generators, Pseudorandom restrictions, Read-once depth-2 formulas, Parity gates} }
Scott Aaronson, Robin Kothari, William Kretschmer, and Justin Thaler. Quantum Lower Bounds for Approximate Counting via Laurent Polynomials. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 7:1-7:47, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{aaronson_et_al:LIPIcs.CCC.2020.7, author = {Aaronson, Scott and Kothari, Robin and Kretschmer, William and Thaler, Justin}, title = {{Quantum Lower Bounds for Approximate Counting via Laurent Polynomials}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {7:1--7:47}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.7}, URN = {urn:nbn:de:0030-drops-125593}, doi = {10.4230/LIPIcs.CCC.2020.7}, annote = {Keywords: Approximate counting, Laurent polynomials, QSampling, query complexity} }
Shir Peleg and Amir Shpilka. A Generalized Sylvester-Gallai Type Theorem for Quadratic Polynomials. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 8:1-8:33, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{peleg_et_al:LIPIcs.CCC.2020.8, author = {Peleg, Shir and Shpilka, Amir}, title = {{A Generalized Sylvester-Gallai Type Theorem for Quadratic Polynomials}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {8:1--8:33}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.8}, URN = {urn:nbn:de:0030-drops-125606}, doi = {10.4230/LIPIcs.CCC.2020.8}, annote = {Keywords: Algebraic computation, Computational complexity, Computational geometry} }
Amey Bhangale and Subhash Khot. Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 9:1-9:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bhangale_et_al:LIPIcs.CCC.2020.9, author = {Bhangale, Amey and Khot, Subhash}, title = {{Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {9:1--9:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.9}, URN = {urn:nbn:de:0030-drops-125610}, doi = {10.4230/LIPIcs.CCC.2020.9}, annote = {Keywords: Simultaneous CSPs, Unique Games hardness, Max-Cut} }
Kuan Cheng and William M. Hoza. Hitting Sets Give Two-Sided Derandomization of Small Space. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 10:1-10:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cheng_et_al:LIPIcs.CCC.2020.10, author = {Cheng, Kuan and Hoza, William M.}, title = {{Hitting Sets Give Two-Sided Derandomization of Small Space}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {10:1--10:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.10}, URN = {urn:nbn:de:0030-drops-125625}, doi = {10.4230/LIPIcs.CCC.2020.10}, annote = {Keywords: hitting sets, derandomization, read-once branching programs} }
Gil Cohen and Shahar Samocha. Palette-Alternating Tree Codes. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 11:1-11:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cohen_et_al:LIPIcs.CCC.2020.11, author = {Cohen, Gil and Samocha, Shahar}, title = {{Palette-Alternating Tree Codes}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {11:1--11:29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.11}, URN = {urn:nbn:de:0030-drops-125632}, doi = {10.4230/LIPIcs.CCC.2020.11}, annote = {Keywords: Tree Codes, Coding Theory, Interactive Coding Scheme} }
Ankit Garg, Christian Ikenmeyer, Visu Makam, Rafael Oliveira, Michael Walter, and Avi Wigderson. Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{garg_et_al:LIPIcs.CCC.2020.12, author = {Garg, Ankit and Ikenmeyer, Christian and Makam, Visu and Oliveira, Rafael and Walter, Michael and Wigderson, Avi}, title = {{Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.12}, URN = {urn:nbn:de:0030-drops-125645}, doi = {10.4230/LIPIcs.CCC.2020.12}, annote = {Keywords: generators for invariant rings, succinct encodings} }
Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, and Guus Regts. Statistical Physics Approaches to Unique Games. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 13:1-13:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{coulson_et_al:LIPIcs.CCC.2020.13, author = {Coulson, Matthew and Davies, Ewan and Kolla, Alexandra and Patel, Viresh and Regts, Guus}, title = {{Statistical Physics Approaches to Unique Games}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {13:1--13:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.13}, URN = {urn:nbn:de:0030-drops-125650}, doi = {10.4230/LIPIcs.CCC.2020.13}, annote = {Keywords: Unique Games Conjecture, approximation algorithm, Potts model, cluster expansion, polynomial interpolation} }
Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, and Srikanth Srinivasan. Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 14:1-14:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chaugule_et_al:LIPIcs.CCC.2020.14, author = {Chaugule, Prasad and Kumar, Mrinal and Limaye, Nutan and Mohapatra, Chandra Kanta and She, Adrian and Srinivasan, Srikanth}, title = {{Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {14:1--14:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.14}, URN = {urn:nbn:de:0030-drops-125660}, doi = {10.4230/LIPIcs.CCC.2020.14}, annote = {Keywords: Schur polynomial, Jacobian, Algebraic independence, Generalized Vandermonde determinant, Taylor expansion, Formula complexity, Lower bound} }
Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, and Igor C. Oliveira. Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 15:1-15:41, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kabanets_et_al:LIPIcs.CCC.2020.15, author = {Kabanets, Valentine and Koroth, Sajin and Lu, Zhenjian and Myrisiotis, Dimitrios and Oliveira, Igor C.}, title = {{Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {15:1--15:41}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.15}, URN = {urn:nbn:de:0030-drops-125673}, doi = {10.4230/LIPIcs.CCC.2020.15}, annote = {Keywords: de Morgan formulas, circuit lower bounds, satisfiability (SAT), pseudorandom generators (PRGs), learning, communication complexity, polynomial threshold functions (PTFs), parities} }
Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang, and Ruizhe Zhang. On the Quantum Complexity of Closest Pair and Related Problems. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 16:1-16:43, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{aaronson_et_al:LIPIcs.CCC.2020.16, author = {Aaronson, Scott and Chia, Nai-Hui and Lin, Han-Hsuan and Wang, Chunhao and Zhang, Ruizhe}, title = {{On the Quantum Complexity of Closest Pair and Related Problems}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {16:1--16:43}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.16}, URN = {urn:nbn:de:0030-drops-125681}, doi = {10.4230/LIPIcs.CCC.2020.16}, annote = {Keywords: Closest pair, Quantum computing, Quantum fine grained reduction, Quantum strong exponential time hypothesis, Fine grained complexity} }
Yuval Filmus, Yuval Ishai, Avi Kaplan, and Guy Kindler. Limits of Preprocessing. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 17:1-17:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{filmus_et_al:LIPIcs.CCC.2020.17, author = {Filmus, Yuval and Ishai, Yuval and Kaplan, Avi and Kindler, Guy}, title = {{Limits of Preprocessing}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {17:1--17:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.17}, URN = {urn:nbn:de:0030-drops-125697}, doi = {10.4230/LIPIcs.CCC.2020.17}, annote = {Keywords: circuit, communication complexity, IPPP, preprocessing, PRF, simultaneous messages} }
Hamed Hatami, Kaave Hosseini, and Shachar Lovett. Sign Rank vs Discrepancy. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{hatami_et_al:LIPIcs.CCC.2020.18, author = {Hatami, Hamed and Hosseini, Kaave and Lovett, Shachar}, title = {{Sign Rank vs Discrepancy}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.18}, URN = {urn:nbn:de:0030-drops-125700}, doi = {10.4230/LIPIcs.CCC.2020.18}, annote = {Keywords: Discrepancy, sign rank, Unbounded-error communication complexity, weakly unbounded error communication complexity} }
Mika Göös, Pritish Kamath, Katerina Sotiraki, and Manolis Zampetakis. On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 19:1-19:42, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{goos_et_al:LIPIcs.CCC.2020.19, author = {G\"{o}\"{o}s, Mika and Kamath, Pritish and Sotiraki, Katerina and Zampetakis, Manolis}, title = {{On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {19:1--19:42}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.19}, URN = {urn:nbn:de:0030-drops-125712}, doi = {10.4230/LIPIcs.CCC.2020.19}, annote = {Keywords: Total NP Search Problems, Modulo-q arguments, Chevalley - Warning Theorem} }
Shuichi Hirahara. Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 20:1-20:47, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{hirahara:LIPIcs.CCC.2020.20, author = {Hirahara, Shuichi}, title = {{Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {20:1--20:47}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.20}, URN = {urn:nbn:de:0030-drops-125720}, doi = {10.4230/LIPIcs.CCC.2020.20}, annote = {Keywords: meta-complexity, pseudorandom generator, hitting set generator} }
Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, and Nitin Saurabh. Algebraic Branching Programs, Border Complexity, and Tangent Spaces. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 21:1-21:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{blaser_et_al:LIPIcs.CCC.2020.21, author = {Bl\"{a}ser, Markus and Ikenmeyer, Christian and Mahajan, Meena and Pandey, Anurag and Saurabh, Nitin}, title = {{Algebraic Branching Programs, Border Complexity, and Tangent Spaces}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {21:1--21:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.21}, URN = {urn:nbn:de:0030-drops-125733}, doi = {10.4230/LIPIcs.CCC.2020.21}, annote = {Keywords: Algebraic Branching Programs, Border Complexity, Tangent Spaces, Lower Bounds, Geometric Complexity Theory, Flows, VQP, VNP} }
Rahul Ilango, Bruno Loff, and Igor C. Oliveira. NP-Hardness of Circuit Minimization for Multi-Output Functions. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 22:1-22:36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ilango_et_al:LIPIcs.CCC.2020.22, author = {Ilango, Rahul and Loff, Bruno and Oliveira, Igor C.}, title = {{NP-Hardness of Circuit Minimization for Multi-Output Functions}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {22:1--22:36}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.22}, URN = {urn:nbn:de:0030-drops-125744}, doi = {10.4230/LIPIcs.CCC.2020.22}, annote = {Keywords: MCSP, circuit minimization, communication complexity, Boolean circuit} }
Nikhil Gupta, Chandan Saha, and Bhargav Thankey. A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 23:1-23:31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gupta_et_al:LIPIcs.CCC.2020.23, author = {Gupta, Nikhil and Saha, Chandan and Thankey, Bhargav}, title = {{A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {23:1--23:31}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.23}, URN = {urn:nbn:de:0030-drops-125757}, doi = {10.4230/LIPIcs.CCC.2020.23}, annote = {Keywords: depth four arithmetic circuits, Projected Shifted Partials, super-quadratic lower bound} }
Alexander Kozachinskiy and Vladimir Podolskii. Multiparty Karchmer - Wigderson Games and Threshold Circuits. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 24:1-24:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kozachinskiy_et_al:LIPIcs.CCC.2020.24, author = {Kozachinskiy, Alexander and Podolskii, Vladimir}, title = {{Multiparty Karchmer - Wigderson Games and Threshold Circuits}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {24:1--24:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.24}, URN = {urn:nbn:de:0030-drops-125767}, doi = {10.4230/LIPIcs.CCC.2020.24}, annote = {Keywords: Karchmer-Wigderson Games, Threshold Circuits, threshold gates, majority function} }
Eshan Chattopadhyay and Jyun-Jie Liao. Optimal Error Pseudodistributions for Read-Once Branching Programs. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 25:1-25:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chattopadhyay_et_al:LIPIcs.CCC.2020.25, author = {Chattopadhyay, Eshan and Liao, Jyun-Jie}, title = {{Optimal Error Pseudodistributions for Read-Once Branching Programs}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {25:1--25:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.25}, URN = {urn:nbn:de:0030-drops-125779}, doi = {10.4230/LIPIcs.CCC.2020.25}, annote = {Keywords: Derandomization, explicit constructions, space-bounded computation} }
Michael Saks and Rahul Santhanam. Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 26:1-26:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{saks_et_al:LIPIcs.CCC.2020.26, author = {Saks, Michael and Santhanam, Rahul}, title = {{Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {26:1--26:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.26}, URN = {urn:nbn:de:0030-drops-125786}, doi = {10.4230/LIPIcs.CCC.2020.26}, annote = {Keywords: Minimum Circuit Size Problem, Turing reductions, circuit lower bounds} }
Marvin Künnemann and Dániel Marx. Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 27:1-27:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kunnemann_et_al:LIPIcs.CCC.2020.27, author = {K\"{u}nnemann, Marvin and Marx, D\'{a}niel}, title = {{Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {27:1--27:28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.27}, URN = {urn:nbn:de:0030-drops-125791}, doi = {10.4230/LIPIcs.CCC.2020.27}, annote = {Keywords: Fine-grained complexity theory, algorithmic classification theorem, multivariate algorithms and complexity, constraint satisfaction problems, satisfiability} }
Susanna F. de Rezende, Jakob Nordström, Kilian Risse, and Dmitry Sokolov. Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 28:1-28:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{derezende_et_al:LIPIcs.CCC.2020.28, author = {de Rezende, Susanna F. and Nordstr\"{o}m, Jakob and Risse, Kilian and Sokolov, Dmitry}, title = {{Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {28:1--28:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.28}, URN = {urn:nbn:de:0030-drops-125804}, doi = {10.4230/LIPIcs.CCC.2020.28}, annote = {Keywords: proof complexity, resolution, weak pigeonhole principle, perfect matching, sparse graphs} }
Laurent Bartholdi, Michael Figelius, Markus Lohrey, and Armin Weiß. Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 29:1-29:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bartholdi_et_al:LIPIcs.CCC.2020.29, author = {Bartholdi, Laurent and Figelius, Michael and Lohrey, Markus and Wei{\ss}, Armin}, title = {{Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {29:1--29:29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.29}, URN = {urn:nbn:de:0030-drops-125814}, doi = {10.4230/LIPIcs.CCC.2020.29}, annote = {Keywords: NC^1-hardness, word problem, G-programs, straight-line programs, non-solvable groups, self-similar groups, Thompson’s groups, Grigorchuk’s group} }
Jacques Dark and Christian Konrad. Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 30:1-30:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dark_et_al:LIPIcs.CCC.2020.30, author = {Dark, Jacques and Konrad, Christian}, title = {{Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {30:1--30:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.30}, URN = {urn:nbn:de:0030-drops-125824}, doi = {10.4230/LIPIcs.CCC.2020.30}, annote = {Keywords: Maximum matching, Minimum vertex cover, Dynamic graph streams, Communication complexity, Lower bounds} }
Rahul Ilango. Connecting Perebor Conjectures: Towards a Search to Decision Reduction for Minimizing Formulas. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 31:1-31:35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ilango:LIPIcs.CCC.2020.31, author = {Ilango, Rahul}, title = {{Connecting Perebor Conjectures: Towards a Search to Decision Reduction for Minimizing Formulas}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {31:1--31:35}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.31}, URN = {urn:nbn:de:0030-drops-125834}, doi = {10.4230/LIPIcs.CCC.2020.31}, annote = {Keywords: minimum circuit size problem, minimum formula size problem, gate elimination, search to decision reduction, self-reducibility} }
Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, and Manaswi Paraashar. Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 32:1-32:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chakraborty_et_al:LIPIcs.CCC.2020.32, author = {Chakraborty, Sourav and Chattopadhyay, Arkadev and Mande, Nikhil S. and Paraashar, Manaswi}, title = {{Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {32:1--32:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.32}, URN = {urn:nbn:de:0030-drops-125842}, doi = {10.4230/LIPIcs.CCC.2020.32}, annote = {Keywords: Quantum query complexity, quantum communication complexity, approximate degree, approximate spectral norm} }
Amit Sinhababu and Thomas Thierauf. Factorization of Polynomials Given By Arithmetic Branching Programs. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 33:1-33:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{sinhababu_et_al:LIPIcs.CCC.2020.33, author = {Sinhababu, Amit and Thierauf, Thomas}, title = {{Factorization of Polynomials Given By Arithmetic Branching Programs}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {33:1--33:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.33}, URN = {urn:nbn:de:0030-drops-125854}, doi = {10.4230/LIPIcs.CCC.2020.33}, annote = {Keywords: Arithmetic Branching Program, Multivariate Polynomial Factorization, Hensel Lifting, Newton Iteration, Hardness vs Randomness} }
Daniel Dadush and Samarth Tiwari. On the Complexity of Branching Proofs. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 34:1-34:35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dadush_et_al:LIPIcs.CCC.2020.34, author = {Dadush, Daniel and Tiwari, Samarth}, title = {{On the Complexity of Branching Proofs}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {34:1--34:35}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.34}, URN = {urn:nbn:de:0030-drops-125863}, doi = {10.4230/LIPIcs.CCC.2020.34}, annote = {Keywords: Branching Proofs, Cutting Planes, Diophantine Approximation, Integer Programming, Stabbing Planes, Tseitin Formulas} }
Swastik Kopparty, Guy Moshkovitz, and Jeroen Zuiddam. Geometric Rank of Tensors and Subrank of Matrix Multiplication. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 35:1-35:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kopparty_et_al:LIPIcs.CCC.2020.35, author = {Kopparty, Swastik and Moshkovitz, Guy and Zuiddam, Jeroen}, title = {{Geometric Rank of Tensors and Subrank of Matrix Multiplication}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {35:1--35:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.35}, URN = {urn:nbn:de:0030-drops-125874}, doi = {10.4230/LIPIcs.CCC.2020.35}, annote = {Keywords: Algebraic complexity theory, Extremal combinatorics, Tensors, Bias, Analytic rank, Algebraic geometry, Matrix multiplication} }
Huck Bennett and Chris Peikert. Hardness of Bounded Distance Decoding on Lattices in 𝓁_p Norms. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 36:1-36:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bennett_et_al:LIPIcs.CCC.2020.36, author = {Bennett, Huck and Peikert, Chris}, title = {{Hardness of Bounded Distance Decoding on Lattices in 𝓁\underlinep Norms}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {36:1--36:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.36}, URN = {urn:nbn:de:0030-drops-125881}, doi = {10.4230/LIPIcs.CCC.2020.36}, annote = {Keywords: Lattices, Bounded Distance Decoding, NP-hardness, Fine-Grained Complexity} }
Robert Andrews. Algebraic Hardness Versus Randomness in Low Characteristic. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 37:1-37:32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{andrews:LIPIcs.CCC.2020.37, author = {Andrews, Robert}, title = {{Algebraic Hardness Versus Randomness in Low Characteristic}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {37:1--37:32}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.37}, URN = {urn:nbn:de:0030-drops-125895}, doi = {10.4230/LIPIcs.CCC.2020.37}, annote = {Keywords: Polynomial identity testing, hardness versus randomness, low characteristic} }
Aaron Potechin. Sum of Squares Bounds for the Ordering Principle. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 38:1-38:37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{potechin:LIPIcs.CCC.2020.38, author = {Potechin, Aaron}, title = {{Sum of Squares Bounds for the Ordering Principle}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {38:1--38:37}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.38}, URN = {urn:nbn:de:0030-drops-125900}, doi = {10.4230/LIPIcs.CCC.2020.38}, annote = {Keywords: sum of squares hierarchy, proof complexity, ordering principle} }
Feedback for Dagstuhl Publishing