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/journals/eccc/eccc25.bht:"
download as .bib file
@article{DBLP:journals/eccc/0001OS18,
author = {Krishnamoorthy Dinesh and
Samir Otiv and
Jayalal Sarma},
title = {New Bounds for Energy Complexity of Boolean Functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-153}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/153},
eprinttype = {ECCC},
eprint = {TR18-153},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/0001OS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/0001S18,
author = {Krishnamoorthy Dinesh and
Jayalal Sarma},
title = {Sensitivity, Affine Transforms and Quantum Communication Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-152}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/152},
eprinttype = {ECCC},
eprint = {TR18-152},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/0001S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/0003SS18,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
title = {Finding forbidden minors in sublinear time: a n\({}^{\mbox{1/2+o(1)}}\)-query
one-sided tester for minor closed properties on bounded degree graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-148}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/148},
eprinttype = {ECCC},
eprint = {TR18-148},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/0003SS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Aaronson18,
author = {Scott Aaronson},
title = {PDQP/qpoly = {ALL}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-099}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/099},
eprinttype = {ECCC},
eprint = {TR18-099},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Aaronson18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Aaronson18a,
author = {Scott Aaronson},
title = {Quantum Lower Bound for Approximate Counting Via Laurent Polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-137}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/137},
eprinttype = {ECCC},
eprint = {TR18-137},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Aaronson18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AcharyaCT18,
author = {Jayadev Acharya and
Cl{\'{e}}ment L. Canonne and
Himanshu Tyagi},
title = {Distributed Simulation and Distributed Inference},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-079}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/079},
eprinttype = {ECCC},
eprint = {TR18-079},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AcharyaCT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalGS18,
author = {Manindra Agrawal and
Sumanta Ghosh and
Nitin Saxena},
title = {Bootstrapping variables in algebraic circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-035}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/035},
eprinttype = {ECCC},
eprint = {TR18-035},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AllenderIV18,
author = {Eric Allender and
Rahul Ilango and
Neekon Vafa},
title = {The Non-Hardness of Approximating Circuit Size},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-173}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/173},
eprinttype = {ECCC},
eprint = {TR18-173},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AllenderIV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AnshuBT18,
author = {Anurag Anshu and
Naresh Goud Boddu and
Dave Touchette},
title = {Quantum Log-Approximate-Rank Conjecture is also False},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-201}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/201},
eprinttype = {ECCC},
eprint = {TR18-201},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AnshuBT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ApplebaumHMS18,
author = {Benny Applebaum and
Thomas Holenstein and
Manoj Mishra and
Ofer Shayevitz},
title = {The Communication Complexity of Private Simultaneous Messages, Revisited},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-033}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/033},
eprinttype = {ECCC},
eprint = {TR18-033},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ApplebaumHMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ApplebaumV18,
author = {Benny Applebaum and
Prashant Nalini Vasudevan},
title = {Placing Conditional Disclosure of Secrets in the Communication Complexity
Universe},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-208}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/208},
eprinttype = {ECCC},
eprint = {TR18-208},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ApplebaumV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ArunachalamCKSW18,
author = {Srinivasan Arunachalam and
Sourav Chakraborty and
Michal Kouck{\'{y}} and
Nitin Saurabh and
Ronald de Wolf},
title = {Improved bounds on Fourier entropy and Min-entropy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-167}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/167},
eprinttype = {ECCC},
eprint = {TR18-167},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ArunachalamCKSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ArvindCDM18,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {Beating Brute Force for Polynomial Identity Testing of General Depth-3
Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-111}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/111},
eprinttype = {ECCC},
eprint = {TR18-111},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ArvindCDM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BadrinarayananK18,
author = {Saikrishna Badrinarayanan and
Yael Kalai and
Dakshita Khurana and
Amit Sahai and
Daniel Wichs},
title = {Non-Interactive Delegation for Low-Space Non-Deterministic Computation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-009}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/009},
eprinttype = {ECCC},
eprint = {TR18-009},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BadrinarayananK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BafnaGGS18,
author = {Mitali Bafna and
Badih Ghazi and
Noah Golowich and
Madhu Sudan},
title = {Communication-Rounds Tradeoffs for Common Randomness and Secret Key
Generation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-150}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/150},
eprinttype = {ECCC},
eprint = {TR18-150},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BafnaGGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BajpaiKKLS18,
author = {Swapnam Bajpai and
Vaibhav Krishan and
Deepanshu Kush and
Nutan Limaye and
Srikanth Srinivasan},
title = {A {\#}SAT Algorithm for Small Constant-Depth Circuits with {PTF} gates},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-162}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/162},
eprinttype = {ECCC},
eprint = {TR18-162},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BajpaiKKLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BallDGMT18,
author = {Marshall Ball and
Dana Dachman{-}Soled and
Siyao Guo and
Tal Malkin and
Li{-}Yang Tan},
title = {Non-Malleable Codes for Small-Depth Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-040}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/040},
eprinttype = {ECCC},
eprint = {TR18-040},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/BallDGMT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakKS18,
author = {Boaz Barak and
Pravesh Kothari and
David Steurer},
title = {Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-077}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/077},
eprinttype = {ECCC},
eprint = {TR18-077},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BarakKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeameGY18,
author = {Paul Beame and
Shayan Oveis Gharan and
Xin Yang},
title = {Time-Space Tradeoffs for Learning Finite Functions from Random Evaluations,
with Applications to Polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-114}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/114},
eprinttype = {ECCC},
eprint = {TR18-114},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeameGY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-AroyaCDT18,
author = {Avraham Ben{-}Aroya and
Gil Cohen and
Dean Doron and
Amnon Ta{-}Shma},
title = {Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient
Functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-066}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/066},
eprinttype = {ECCC},
eprint = {TR18-066},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-AroyaCDT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-AroyaDT18,
author = {Avraham Ben{-}Aroya and
Dean Doron and
Amnon Ta{-}Shma},
title = {Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-065}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/065},
eprinttype = {ECCC},
eprint = {TR18-065},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-AroyaDT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-Eliezer18,
author = {Omri Ben{-}Eliezer},
title = {Testing local properties of arrays},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-196}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/196},
eprinttype = {ECCC},
eprint = {TR18-196},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-Eliezer18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-EliezerF18,
author = {Omri Ben{-}Eliezer and
Eldar Fischer},
title = {Earthmover Resilience and Testing in Ordered Structures},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-021}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/021},
eprinttype = {ECCC},
eprint = {TR18-021},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-EliezerF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-SassonKS18,
author = {Eli Ben{-}Sasson and
Swastik Kopparty and
Shubhangi Saraf},
title = {Worst-case to average case reductions for the distance to a code},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-090}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/090},
eprinttype = {ECCC},
eprint = {TR18-090},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffBM18,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Meena Mahajan},
title = {Building Strategies into {QBF} Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-172}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/172},
eprinttype = {ECCC},
eprint = {TR18-172},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffBM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffC18,
author = {Olaf Beyersdorff and
Judith Clymo},
title = {More on Size and Width in {QBF} Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-025}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/025},
eprinttype = {ECCC},
eprint = {TR18-025},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffCCM18,
author = {Olaf Beyersdorff and
Leroy Chew and
Judith Clymo and
Meena Mahajan},
title = {Short Proofs in {QBF} Expansion},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-102}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/102},
eprinttype = {ECCC},
eprint = {TR18-102},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffCCM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffCDM18,
author = {Olaf Beyersdorff and
Judith Clymo and
Stefan S. Dantchev and
Barnaby Martin},
title = {The Riis Complexity Gap for {QBF} Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-024}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/024},
eprinttype = {ECCC},
eprint = {TR18-024},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffCDM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhandariHMS18,
author = {Siddharth Bhandari and
Prahladh Harsha and
Tulasimohan Molli and
Srikanth Srinivasan},
title = {On the Probabilistic Degree of {OR} over the Reals},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-207}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/207},
eprinttype = {ECCC},
eprint = {TR18-207},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhandariHMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bhangale18,
author = {Amey Bhangale},
title = {NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically
many colors},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-073}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/073},
eprinttype = {ECCC},
eprint = {TR18-073},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bhangale18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhargavaSV18,
author = {Vishwas Bhargava and
Shubhangi Saraf and
Ilya Volkovich},
title = {Deterministic Factorization of Sparse Polynomials with Bounded Individual
Degree},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-130}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/130},
eprinttype = {ECCC},
eprint = {TR18-130},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhargavaSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhattacharyyaGS18,
author = {Arnab Bhattacharyya and
Suprovat Ghoshal and
{Karthik {C. S.}} and
Pasin Manurangsi},
title = {Parameterized Intractability of Even Set and Shortest Vector Problem
from Gap-ETH},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-057}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/057},
eprinttype = {ECCC},
eprint = {TR18-057},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhattacharyyaGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhattiproluGGLT18,
author = {Vijay Bhattiprolu and
Mrinalkanti Ghosh and
Venkatesan Guruswami and
Euiwoong Lee and
Madhur Tulsiani},
title = {Inapproximability of Matrix p{\(\rightarrow\)}q Norms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-037}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/037},
eprinttype = {ECCC},
eprint = {TR18-037},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhattiproluGGLT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhattiproluGGLT18a,
author = {Vijay Bhattiprolu and
Mrinalkanti Ghosh and
Venkatesan Guruswami and
Euiwoong Lee and
Madhur Tulsiani},
title = {Approximating Operator Norms via Generalized Krivine Rounding},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-097}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/097},
eprinttype = {ECCC},
eprint = {TR18-097},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhattiproluGGLT18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhrushundiHHKK18,
author = {Abhishek Bhrushundi and
Prahladh Harsha and
Pooya Hatami and
Swastik Kopparty and
Mrinal Kumar},
title = {On Multilinear Forms: Bias, Correlation, and Tensor Rank},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-081}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/081},
eprinttype = {ECCC},
eprint = {TR18-081},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhrushundiHHKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhrushundiHLR18,
author = {Abhishek Bhrushundi and
Kaave Hosseini and
Shachar Lovett and
Sankeerth Rao},
title = {Torus polynomials: an algebraic approach to {ACC} lower bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-076}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/076},
eprinttype = {ECCC},
eprint = {TR18-076},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhrushundiHLR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlackCS18,
author = {Hadley Black and
Deeparnab Chakrabarty and
C. Seshadhri},
title = {Domain Reduction for Monotonicity Testing: {A} {\textdollar}o(d){\textdollar}
Tester for Boolean Functions on Hypergrids},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-187}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/187},
eprinttype = {ECCC},
eprint = {TR18-187},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlackCS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlaserIJL18,
author = {Markus Bl{\"{a}}ser and
Christian Ikenmeyer and
Gorav Jindal and
Vladimir Lysikov},
title = {Generalized Matrix Completion and Algebraic Natural Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-064}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/064},
eprinttype = {ECCC},
eprint = {TR18-064},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlaserIJL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlasiokGNRS18,
author = {Jaroslaw Blasiok and
Venkatesan Guruswami and
Preetum Nakkiran and
Atri Rudra and
Madhu Sudan},
title = {General Strong Polarization},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-027}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/027},
eprinttype = {ECCC},
eprint = {TR18-027},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlasiokGNRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bogdanov18,
author = {Andrej Bogdanov},
title = {Approximate degree of {AND} via Fourier analysis},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-197}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/197},
eprinttype = {ECCC},
eprint = {TR18-197},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bogdanov18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovSV18,
author = {Andrej Bogdanov and
Manuel Sabin and
Prashant Nalini Vasudevan},
title = {{XOR} Codes and Sparse Random Linear Equations with Noise},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-085}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/085},
eprinttype = {ECCC},
eprint = {TR18-085},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakensiekG18,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {Combining LPs and Ring Equations via Structured Polymorphisms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-059}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/059},
eprinttype = {ECCC},
eprint = {TR18-059},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakensiekG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Brakerski18,
author = {Zvika Brakerski},
title = {Fundamentals of Fully Homomorphic Encryption - {A} Survey},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-125}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/125},
eprinttype = {ECCC},
eprint = {TR18-125},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Brakerski18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakerskiLVW18,
author = {Zvika Brakerski and
Vadim Lyubashevsky and
Vinod Vaikuntanathan and
Daniel Wichs},
title = {Worst-Case Hardness for {LPN} and Cryptographic Hashing via Code Smoothing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-056}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/056},
eprinttype = {ECCC},
eprint = {TR18-056},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakerskiLVW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty18,
author = {Nader H. Bshouty},
title = {Lower Bound for Non-Adaptive Estimate the Number of Defective Items},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-053}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/053},
eprinttype = {ECCC},
eprint = {TR18-053},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BunKT18,
author = {Mark Bun and
Robin Kothari and
Justin Thaler},
title = {Quantum algorithms and approximating polynomials for composed functions
with shared inputs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-156}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/156},
eprinttype = {ECCC},
eprint = {TR18-156},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BunKT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BunT18,
author = {Mark Bun and
Justin Thaler},
title = {The Large-Error Approximate Degree of AC\({}^{\mbox{0}}\)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-143}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/143},
eprinttype = {ECCC},
eprint = {TR18-143},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BunT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BussIKS18,
author = {Sam Buss and
Dmitry Itsykson and
Alexander Knop and
Dmitry Sokolov},
title = {Reordering Rule Makes {OBDD} Proof Systems Stronger},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-041}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/041},
eprinttype = {ECCC},
eprint = {TR18-041},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BussIKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CarmosinoILM18,
author = {Marco Carmosino and
Russell Impagliazzo and
Shachar Lovett and
Ivan Mihajlin},
title = {Hardness Amplification for Non-Commutative Arithmetic Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-095}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/095},
eprinttype = {ECCC},
eprint = {TR18-095},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CarmosinoILM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CarmosinoIS18,
author = {Marco Carmosino and
Russell Impagliazzo and
Manuel Sabin},
title = {Fine-Grained Derandomization: From Problem-Centric to Resource-Centric
Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-092}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/092},
eprinttype = {ECCC},
eprint = {TR18-092},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CarmosinoIS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabartyS18,
author = {Deeparnab Chakrabarty and
C. Seshadhri},
title = {Adaptive Boolean Monotonicity Testing in Total Influence Time},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-005}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/005},
eprinttype = {ECCC},
eprint = {TR18-005},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabartyS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChatterjeeS18,
author = {Prerona Chatterjee and
Ramprasad Saptharishi},
title = {Constructing Faithful Homomorphisms over Fields of Finite Characteristic},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-212}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/212},
eprinttype = {ECCC},
eprint = {TR18-212},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChatterjeeS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayDS18,
author = {Eshan Chattopadhyay and
Anindya De and
Rocco A. Servedio},
title = {Simple and efficient pseudorandom generators from Gaussian processes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-100}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/100},
eprinttype = {ECCC},
eprint = {TR18-100},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayDS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayHH18,
author = {Eshan Chattopadhyay and
Pooya Hatami and
Kaave Hosseini and
Shachar Lovett},
title = {Pseudorandom Generators from Polarizing Random Walks},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-015}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/015},
eprinttype = {ECCC},
eprint = {TR18-015},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayHH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayHL18,
author = {Eshan Chattopadhyay and
Pooya Hatami and
Shachar Lovett and
Avishay Tal},
title = {Pseudorandom generators from the second Fourier level and applications
to {AC0} with parity gates},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-155}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/155},
eprinttype = {ECCC},
eprint = {TR18-155},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayHL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayL18,
author = {Eshan Chattopadhyay and
Xin Li},
title = {Non-Malleable Extractors and Codes in the Interleaved Split-State
Model and More},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-070}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/070},
eprinttype = {ECCC},
eprint = {TR18-070},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayLV18,
author = {Arkadev Chattopadhyay and
Shachar Lovett and
Marc Vinyals},
title = {Equality Alone Does Not Simulate Randomness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-206}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/206},
eprinttype = {ECCC},
eprint = {TR18-206},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayLV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayMS18,
author = {Arkadev Chattopadhyay and
Nikhil S. Mande and
Suhail Sherif},
title = {The Log-Approximate-Rank Conjecture is False},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-176}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/176},
eprinttype = {ECCC},
eprint = {TR18-176},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChaubalG18,
author = {Siddhesh Chaubal and
Anna G{\'{a}}l},
title = {New Constructions with Quadratic Separation between Sensitivity and
Block Sensitivity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-205}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/205},
eprinttype = {ECCC},
eprint = {TR18-205},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChaubalG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChauguleLV18,
author = {Prasad Chaugule and
Nutan Limaye and
Aditya Varre},
title = {Variants of Homomorphism Polynomials Complete for Algebraic Complexity
Classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-135}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/135},
eprinttype = {ECCC},
eprint = {TR18-135},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChauguleLV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Chen18,
author = {Lijie Chen},
title = {On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner
Product},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-026}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/026},
eprinttype = {ECCC},
eprint = {TR18-026},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Chen18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenGVZ18,
author = {Yi{-}Hsiu Chen and
Mika G{\"{o}}{\"{o}}s and
Salil P. Vadhan and
Jiapeng Zhang},
title = {A Tight Lower Bound for Entropy Flattening},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-119}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/119},
eprinttype = {ECCC},
eprint = {TR18-119},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenGVZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenT18,
author = {Lijie Chen and
Roei Tell},
title = {Bootstrapping Results for Threshold Circuits "Just Beyond" Known Lower
Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-199}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/199},
eprinttype = {ECCC},
eprint = {TR18-199},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenZ18,
author = {Xue Chen and
David Zuckerman},
title = {Existence of Simple Extractors},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-116}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/116},
eprinttype = {ECCC},
eprint = {TR18-116},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Chew18,
author = {Leroy Chew},
title = {Hardness and Optimality in {QBF} Proof Systems Modulo {NP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-178}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/178},
eprinttype = {ECCC},
eprint = {TR18-178},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Chew18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChiesaFGS18,
author = {Alessandro Chiesa and
Michael A. Forbes and
Tom Gur and
Nicholas Spooner},
title = {Spatial Isolation Implies Zero Knowledge Even in a Quantum World},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-044}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/044},
eprinttype = {ECCC},
eprint = {TR18-044},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChiesaFGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChiesaMS18,
author = {Alessandro Chiesa and
Peter Manohar and
Igor Shinkar},
title = {Testing Linearity against Non-Signaling Strategies},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-067}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/067},
eprinttype = {ECCC},
eprint = {TR18-067},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChiesaMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChiesaMS18a,
author = {Alessandro Chiesa and
Peter Manohar and
Igor Shinkar},
title = {Probabilistic Checking against Non-Signaling Strategies from Linearity
Testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-123}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/123},
eprinttype = {ECCC},
eprint = {TR18-123},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChiesaMS18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChillaraELS18,
author = {Suryajith Chillara and
Christian Engels and
Nutan Limaye and
Srikanth Srinivasan},
title = {A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear
Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-062}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/062},
eprinttype = {ECCC},
eprint = {TR18-062},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChillaraELS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChistopolskayaP18,
author = {Anastasiya Chistopolskaya and
Vladimir V. Podolskii},
title = {Parity Decision Tree Complexity is Greater Than Granularity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-174}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/174},
eprinttype = {ECCC},
eprint = {TR18-174},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChistopolskayaP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChouKS18,
author = {Chi{-}Ning Chou and
Mrinal Kumar and
Noam Solomon},
title = {Some Closure Results for Polynomial Factorization and Applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-052}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/052},
eprinttype = {ECCC},
eprint = {TR18-052},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChouKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CohenHS18,
author = {Gil Cohen and
Bernhard Haeupler and
Leonard J. Schulman},
title = {Explicit Binary Tree Codes with Polylogarithmic Size Alphabet},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-032}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/032},
eprinttype = {ECCC},
eprint = {TR18-032},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CohenHS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Corrigan-GibbsK18,
author = {Henry Corrigan{-}Gibbs and
Dmitry Kogan},
title = {The Function-Inversion Problem: Barriers and Opportunities},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-182}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/182},
eprinttype = {ECCC},
eprint = {TR18-182},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Corrigan-GibbsK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DantchevGM18,
author = {Stefan S. Dantchev and
Nicola Galesi and
Barnaby Martin},
title = {Resolution and the binary encoding of combinatorial principles},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-165}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/165},
eprinttype = {ECCC},
eprint = {TR18-165},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DantchevGM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DaskalakisKW18,
author = {Constantinos Daskalakis and
Gautam Kamath and
John Wright},
title = {Which Distribution Distances are Sublinearly Testable?},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-002}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/002},
eprinttype = {ECCC},
eprint = {TR18-002},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DaskalakisKW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DiakonikolasK18,
author = {Ilias Diakonikolas and
Daniel Kane},
title = {Degree-{\textdollar}d{\textdollar} Chow Parameters Robustly Determine
Degree-{\textdollar}d{\textdollar} PTFs (and Algorithmic Applications)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-189}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/189},
eprinttype = {ECCC},
eprint = {TR18-189},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DiakonikolasK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurDFH18,
author = {Irit Dinur and
Yotam Dikstein and
Yuval Filmus and
Prahladh Harsha},
title = {Boolean function analysis on high-dimensional expanders},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-075}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/075},
eprinttype = {ECCC},
eprint = {TR18-075},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DinurDFH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurGG18,
author = {Irit Dinur and
Oded Goldreich and
Tom Gur},
title = {Every set in {P} is strongly testable under a suitable encoding},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-050}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/050},
eprinttype = {ECCC},
eprint = {TR18-050},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DinurGG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurHKNT18,
author = {Irit Dinur and
Prahladh Harsha and
Tali Kaufman and
Inbal Livni Navon and
Amnon Ta{-}Shma},
title = {List Decoding with Double Samplers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-136}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/136},
eprinttype = {ECCC},
eprint = {TR18-136},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DinurHKNT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurKR18,
author = {Irit Dinur and
Tali Kaufman and
Noga Ron{-}Zewi},
title = {From Local to Robust Testing via Agreement Testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-198}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/198},
eprinttype = {ECCC},
eprint = {TR18-198},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DinurKR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurM18,
author = {Irit Dinur and
Pasin Manurangsi},
title = {ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-093}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/093},
eprinttype = {ECCC},
eprint = {TR18-093},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DinurM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DoronHH18,
author = {Dean Doron and
Pooya Hatami and
William Hoza},
title = {Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once
Formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-183}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/183},
eprinttype = {ECCC},
eprint = {TR18-183},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DoronHH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Dose18,
author = {Titus Dose},
title = {Balance Problems for Integer Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-055}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/055},
eprinttype = {ECCC},
eprint = {TR18-055},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Dose18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DurginJ18,
author = {Alexander Durgin and
Brendan Juba},
title = {Hardness of improper one-sided learning of conjunctions for all uniformly
falsifiable CSPs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-118}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/118},
eprinttype = {ECCC},
eprint = {TR18-118},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DurginJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DvirGW18,
author = {Zeev Dvir and
Alexander Golovnev and
Omri Weinstein},
title = {Static Data Structure Lower Bounds Imply Rigidity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-188}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/188},
eprinttype = {ECCC},
eprint = {TR18-188},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DvirGW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/EfremenkoHK18,
author = {Klim Efremenko and
Elad Haramaty and
Yael Kalai},
title = {Interactive Coding with Constant Round and Communication Blowup},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-054}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/054},
eprinttype = {ECCC},
eprint = {TR18-054},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/EfremenkoHK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FijalkowLO18,
author = {Nathana{\"{e}}l Fijalkow and
Guillaume Lagarde and
Pierre Ohlmann},
title = {Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique
Parse Trees},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-038}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/038},
eprinttype = {ECCC},
eprint = {TR18-038},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FijalkowLO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FijalkowLOS18,
author = {Nathana{\"{e}}l Fijalkow and
Guillaume Lagarde and
Pierre Ohlmann and
Olivier Serre},
title = {Lower bounds for arithmetic circuits via the Hankel matrix},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-180}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/180},
eprinttype = {ECCC},
eprint = {TR18-180},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FijalkowLOS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FitzsimonsJVY18,
author = {Joseph F. Fitzsimons and
Zhengfeng Ji and
Thomas Vidick and
Henry Yuen},
title = {Quantum proof systems for iterated exponential time, and beyond},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-105}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/105},
eprinttype = {ECCC},
eprint = {TR18-105},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FitzsimonsJVY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ForbesGS18,
author = {Michael A. Forbes and
Sumanta Ghosh and
Nitin Saxena},
title = {Towards blackbox identity testing of log-variate circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-036}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/036},
eprinttype = {ECCC},
eprint = {TR18-036},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ForbesGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ForbesK18,
author = {Michael A. Forbes and
Zander Kelley},
title = {Pseudorandom Generators for Read-Once Branching Programs, in any Order},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-147}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/147},
eprinttype = {ECCC},
eprint = {TR18-147},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ForbesK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GajjarR18,
author = {Kshitij Gajjar and
Jaikumar Radhakrishnan},
title = {Parametric Shortest Paths in Planar Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-211}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/211},
eprinttype = {ECCC},
eprint = {TR18-211},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GajjarR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GalTN18,
author = {Anna G{\'{a}}l and
Avishay Tal and
Adrian Trejo Nu{\~{n}}ez},
title = {Cubic Formula Size Lower Bounds Based on Compositions with Majority},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-160}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/160},
eprinttype = {ECCC},
eprint = {TR18-160},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GalTN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GalesiTT18,
author = {Nicola Galesi and
Navid Talebanfard and
Jacobo Tor{\'{a}}n},
title = {Cops-Robber games and the resolution of Tseitin formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-170}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/170},
eprinttype = {ECCC},
eprint = {TR18-170},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GalesiTT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GargO18,
author = {Ankit Garg and
Rafael Mendes de Oliveira},
title = {Recent progress on scaling algorithms and applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-151}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/151},
eprinttype = {ECCC},
eprint = {TR18-151},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GargO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GentryJ18,
author = {Craig Gentry and
Charanjit S. Jutla},
title = {Obfuscation using Tensor Products},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-149}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/149},
eprinttype = {ECCC},
eprint = {TR18-149},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GentryJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GishbolinerS18,
author = {Lior Gishboliner and
Asaf Shapira},
title = {A Generalized Turan Problem and its Applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-007}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/007},
eprinttype = {ECCC},
eprint = {TR18-007},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GishbolinerS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Gobbert18,
author = {Moritz Gobbert},
title = {Edge Hop: {A} Framework to Show NP-Hardness of Combinatorial Games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-080}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/080},
eprinttype = {ECCC},
eprint = {TR18-080},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Gobbert18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Goldreich18,
author = {Oded Goldreich},
title = {Hierarchy Theorems for Testing Properties in Size-Oblivious Query
Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-098}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/098},
eprinttype = {ECCC},
eprint = {TR18-098},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Goldreich18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Goldreich18a,
author = {Oded Goldreich},
title = {Flexible models for testing graph properties},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-104}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/104},
eprinttype = {ECCC},
eprint = {TR18-104},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Goldreich18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Goldreich18b,
author = {Oded Goldreich},
title = {Testing Graphs in Vertex-Distribution-Free Models},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-171}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/171},
eprinttype = {ECCC},
eprint = {TR18-171},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Goldreich18b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoldreichR18,
author = {Oded Goldreich and
Dana Ron},
title = {The Subgraph Testing Model},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-045}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/045},
eprinttype = {ECCC},
eprint = {TR18-045},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoldreichR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoldreichR18a,
author = {Oded Goldreich and
Guy N. Rothblum},
title = {Counting \emph{t}-cliques: Worst-case to average-case reductions and
Direct interactive proof systems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-046}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/046},
eprinttype = {ECCC},
eprint = {TR18-046},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoldreichR18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoldreichR18b,
author = {Oded Goldreich and
Guy N. Rothblum},
title = {Constant-round interactive proof systems for {AC0[2]} and {NC1}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-069}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/069},
eprinttype = {ECCC},
eprint = {TR18-069},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoldreichR18b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GolovnevK18,
author = {Alexander Golovnev and
Alexander S. Kulikov},
title = {Circuit Depth Reductions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-192}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/192},
eprinttype = {ECCC},
eprint = {TR18-192},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GolovnevK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoosKRS18,
author = {Mika G{\"{o}}{\"{o}}s and
Pritish Kamath and
Robert Robere and
Dmitry Sokolov},
title = {Adventures in Monotone Complexity and {TFNP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-163}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/163},
eprinttype = {ECCC},
eprint = {TR18-163},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoosKRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GrinbergSV18,
author = {Aryeh Grinberg and
Ronen Shaltiel and
Emanuele Viola},
title = {Indistinguishability by adaptive procedures with advice, and lower
bounds on hardness amplification proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-061}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/061},
eprinttype = {ECCC},
eprint = {TR18-061},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GrinbergSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GrossmanL18,
author = {Ofer Grossman and
Yang P. Liu},
title = {Reproducibility and Pseudo-Determinism in Log-Space},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-048}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/048},
eprinttype = {ECCC},
eprint = {TR18-048},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GrossmanL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuoSS18,
author = {Zeyu Guo and
Nitin Saxena and
Amit Sinhababu},
title = {Algebraic dependencies and {PSPACE} algorithms in approximative complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-019}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/019},
eprinttype = {ECCC},
eprint = {TR18-019},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuoSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuptaS18,
author = {Nikhil Gupta and
Chandan Saha},
title = {On the symmetries of design polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-164}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/164},
eprinttype = {ECCC},
eprint = {TR18-164},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuptaS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuptaST18,
author = {Chetan Gupta and
Vimalraj Sharma and
Raghunath Tewari},
title = {Reachability in O(log n) Genus Graphs is in Unambiguous},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-106}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/106},
eprinttype = {ECCC},
eprint = {TR18-106},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuptaST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GurLR18,
author = {Tom Gur and
Yang P. Liu and
Ron D. Rothblum},
title = {An Exponential Separation Between {MA} and {AM} Proofs of Proximity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-083}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/083},
eprinttype = {ECCC},
eprint = {TR18-083},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GurLR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GurS18,
author = {Tom Gur and
Igor Shinkar},
title = {An Entropy Lower Bound for Non-Malleable Extractors},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-008}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/008},
eprinttype = {ECCC},
eprint = {TR18-008},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GurS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiR18,
author = {Venkatesan Guruswami and
Andrii Riazanov},
title = {Beating Fredman-Koml{\'{o}}s for perfect k-hashing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-096}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/096},
eprinttype = {ECCC},
eprint = {TR18-096},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiRX18,
author = {Venkatesan Guruswami and
Nicolas Resch and
Chaoping Xing},
title = {Lossless dimension expanders via linearized polynomials and subspace
designs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-017}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/017},
eprinttype = {ECCC},
eprint = {TR18-017},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiRX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HaitnerMO18,
author = {Iftach Haitner and
Nikolaos Makriyannis and
Eran Omri},
title = {On the Complexity of Fair Coin Flipping},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-084}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/084},
eprinttype = {ECCC},
eprint = {TR18-084},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HaitnerMO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HaitnerMORY18,
author = {Iftach Haitner and
Noam Mazor and
Rotem Oshman and
Omer Reingold and
Amir Yehudayoff},
title = {On the Communication Complexity of Key-Agreement Protocols},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-031}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/031},
eprinttype = {ECCC},
eprint = {TR18-031},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HaitnerMORY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HaitnerNOSS18,
author = {Iftach Haitner and
Kobbi Nissim and
Eran Omri and
Ronen Shaltiel and
Jad Silbak},
title = {Computational Two-Party Correlation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-071}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/071},
eprinttype = {ECCC},
eprint = {TR18-071},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HaitnerNOSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HeLSZ18,
author = {Kun He and
Qian Li and
Xiaoming Sun and
Jiapeng Zhang},
title = {Quantum Lov{\'{a}}sz Local Lemma: Shearer's Bound is Tight},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-087}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/087},
eprinttype = {ECCC},
eprint = {TR18-087},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HeLSZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Hirahara18,
author = {Shuichi Hirahara},
title = {Non-black-box Worst-case to Average-case Reductions within {NP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-138}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/138},
eprinttype = {ECCC},
eprint = {TR18-138},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Hirahara18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HiraharaOS18,
author = {Shuichi Hirahara and
Igor Carboni Oliveira and
Rahul Santhanam},
title = {NP-hardness of Minimum Circuit Size Problem for {OR-AND-MOD} Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-030}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/030},
eprinttype = {ECCC},
eprint = {TR18-030},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HiraharaOS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HitchcockS18,
author = {John M. Hitchcock and
Hadi Shafei},
title = {Nonuniform Reductions and NP-Completeness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-011}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/011},
eprinttype = {ECCC},
eprint = {TR18-011},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HitchcockS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HitchcockS18a,
author = {John M. Hitchcock and
Adewale Sekoni},
title = {Nondeterminisic Sublinear Time Has Measure 0 in {P}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-013}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/013},
eprinttype = {ECCC},
eprint = {TR18-013},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HitchcockS18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HitchcockSS18,
author = {John M. Hitchcock and
Adewale Sekoni and
Hadi Shafei},
title = {Polynomial-Time Random Oracles and Separating Complexity Classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-018}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/018},
eprinttype = {ECCC},
eprint = {TR18-018},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HitchcockSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HollenderG18,
author = {Alexandros Hollender and
Paul W. Goldberg},
title = {The Complexity of Multi-source Variants of the End-of-Line Problem,
and the Concise Mutilated Chessboard},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-120}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/120},
eprinttype = {ECCC},
eprint = {TR18-120},
timestamp = {Fri, 06 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HollenderG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HolmgrenR18,
author = {Justin Holmgren and
Ron Rothblum},
title = {Delegating Computations with (almost) Minimal Time and Space Overhead},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-161}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/161},
eprinttype = {ECCC},
eprint = {TR18-161},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HolmgrenR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HolmgrenY18,
author = {Justin Holmgren and
Lisa Yang},
title = {Characterizing Parallel Repetition of Non-Signaling Games: Counterexamples
and a Dichotomy Theorem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-121}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/121},
eprinttype = {ECCC},
eprint = {TR18-121},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HolmgrenY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HooverIMS18,
author = {Kenneth Hoover and
Russell Impagliazzo and
Ivan Mihajlin and
Alexander Smal},
title = {Half-duplex communication complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-089}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/089},
eprinttype = {ECCC},
eprint = {TR18-089},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HooverIMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HosseiniL18,
author = {Kaave Hosseini and
Shachar Lovett},
title = {A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-142}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/142},
eprinttype = {ECCC},
eprint = {TR18-142},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HosseiniL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HosseiniLY18,
author = {Kaave Hosseini and
Shachar Lovett and
Grigory Yaroslavtsev},
title = {Optimality of Linear Sketching under Modular Updates},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-169}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/169},
eprinttype = {ECCC},
eprint = {TR18-169},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HosseiniLY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HozaZ18,
author = {William Hoza and
David Zuckerman},
title = {Simple Optimal Hitting Sets for Small-Success {RL}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-063}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/063},
eprinttype = {ECCC},
eprint = {TR18-063},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HozaZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/IcelandS18,
author = {Eran Iceland and
Alex Samorodnitsky},
title = {On coset leader graphs of structured linear codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-023}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/023},
eprinttype = {ECCC},
eprint = {TR18-023},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/IcelandS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Jukna18,
author = {Stasys Jukna},
title = {Incremental versus Non-Incremental Dynamic Programming},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-042}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/042},
eprinttype = {ECCC},
eprint = {TR18-042},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Jukna18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Jukna18a,
author = {Stasys Jukna},
title = {Derandomizing Dynamic Programming and Beyond},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-051}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/051},
eprinttype = {ECCC},
eprint = {TR18-051},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Jukna18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/JuknaL18,
author = {Stasys Jukna and
Andrzej Lingas},
title = {Lower Bounds for Circuits of Bounded Negation Width},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-154}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/154},
eprinttype = {ECCC},
eprint = {TR18-154},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/JuknaL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/JuknaS18,
author = {Stasys Jukna and
Hannes Seiwert},
title = {Greedy can also beat pure dynamic programming},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-049}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/049},
eprinttype = {ECCC},
eprint = {TR18-049},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/JuknaS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/JuknaS18a,
author = {Stasys Jukna and
Hannes Seiwert},
title = {Approximation Limitations of Tropical Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-127}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/127},
eprinttype = {ECCC},
eprint = {TR18-127},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/JuknaS18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KabanetsL18,
author = {Valentine Kabanets and
Zhenjian Lu},
title = {Nisan-Wigderson Pseudorandom Generators for Circuits with Polynomial
Threshold Gates},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-012}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/012},
eprinttype = {ECCC},
eprint = {TR18-012},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KabanetsL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KabanetsL18a,
author = {Valentine Kabanets and
Zhenjian Lu},
title = {Satisfiability and Derandomization for Small Polynomial Threshold
Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-115}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/115},
eprinttype = {ECCC},
eprint = {TR18-115},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KabanetsL18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KalaiK18,
author = {Yael Kalai and
Dakshita Khurana},
title = {Non-Interactive Non-Malleability from Quantum Supremacy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-203}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/203},
eprinttype = {ECCC},
eprint = {TR18-203},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KalaiK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KamathT18,
author = {Gautam Kamath and
Christos Tzamos},
title = {Anaconda: {A} Non-Adaptive Conditional Sampling Algorithm for Distribution
Testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-131}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/131},
eprinttype = {ECCC},
eprint = {TR18-131},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KamathT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KaneLM18,
author = {Daniel M. Kane and
Shachar Lovett and
Shay Moran},
title = {Generalized comparison trees for point-location problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-074}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/074},
eprinttype = {ECCC},
eprint = {TR18-074},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KaneLM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KaufmanM18,
author = {Tali Kaufman and
David Mass},
title = {Cosystolic Expanders over any Abelian Group},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-134}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/134},
eprinttype = {ECCC},
eprint = {TR18-134},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KaufmanM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KayalNS18,
author = {Neeraj Kayal and
Vineet Nair and
Chandan Saha},
title = {Average-case linear matrix factorization and reconstruction of low
width Algebraic Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-029}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/029},
eprinttype = {ECCC},
eprint = {TR18-029},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KayalNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KayalS18,
author = {Neeraj Kayal and
Chandan Saha},
title = {Reconstruction of non-degenerate homogeneous depth three circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-191}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/191},
eprinttype = {ECCC},
eprint = {TR18-191},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KayalS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KhotMMS18,
author = {Subhash Khot and
Dor Minzer and
Dana Moshkovitz and
Muli Safra},
title = {Small Set Expansion in The Johnson Graph},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-078}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/078},
eprinttype = {ECCC},
eprint = {TR18-078},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KhotMMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KhotMS18,
author = {Subhash Khot and
Dor Minzer and
Muli Safra},
title = {Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-006}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/006},
eprinttype = {ECCC},
eprint = {TR18-006},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KhotMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KirshnerS18,
author = {Naomi Kirshner and
Alex Samorodnitsky},
title = {On {\(\mathscr{l}\)}\({}_{\mbox{4}}\): {\(\mathscr{l}\)}\({}_{\mbox{2}}\)
ratio of functions with restricted Fourier support},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-016}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/016},
eprinttype = {ECCC},
eprint = {TR18-016},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KirshnerS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Knop18,
author = {Alexander Knop},
title = {The Diptych of Communication Complexity Classes in the Best-partition
Model and the Fixed-partition Model},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-177}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/177},
eprinttype = {ECCC},
eprint = {TR18-177},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Knop18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ko18,
author = {Young Kun Ko},
title = {On Symmetric Parallel Repetition : Towards Equivalence of {MAX-CUT}
and {UG}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-034}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/034},
eprinttype = {ECCC},
eprint = {TR18-034},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ko18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KomargodskiRK18,
author = {Ilan Komargodski and
Ran Raz and
Yael Tauman Kalai},
title = {A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-140}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/140},
eprinttype = {ECCC},
eprint = {TR18-140},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KomargodskiRK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KoppartyRSW18,
author = {Swastik Kopparty and
Noga Ron{-}Zewi and
Shubhangi Saraf and
Mary Wootters},
title = {Improved decoding of Folded Reed-Solomon and Multiplicity Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-091}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/091},
eprinttype = {ECCC},
eprint = {TR18-091},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KoppartyRSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KothariM18,
author = {Pravesh Kothari and
Ruta Mehta},
title = {Sum-of-Squares meets Nash: Optimal Lower Bounds for Finding any Equilibrium},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-126}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/126},
eprinttype = {ECCC},
eprint = {TR18-126},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KothariM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Kumar18,
author = {Mrinal Kumar},
title = {On top fan-in vs formal degree for depth-3 arithmetic circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-068}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/068},
eprinttype = {ECCC},
eprint = {TR18-068},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Kumar18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarMS18,
author = {Ashutosh Kumar and
Raghu Meka and
Amit Sahai},
title = {Leakage-Resilient Secret Sharing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-200}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/200},
eprinttype = {ECCC},
eprint = {TR18-200},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarSS18,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
title = {Finding forbidden minors in sublinear time: a O(n\({}^{\mbox{1/2+o(1)}}\))-query
one-sided tester for minor closed properties on bounded degree graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-101}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/101},
eprinttype = {ECCC},
eprint = {TR18-101},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarST18,
author = {Mrinal Kumar and
Ramprasad Saptharishi and
Anamay Tengse},
title = {Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-132}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/132},
eprinttype = {ECCC},
eprint = {TR18-132},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LarsenN18,
author = {Kasper Green Larsen and
Jesper Buus Nielsen},
title = {Yes, There is an Oblivious {RAM} Lower Bound!},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-109}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/109},
eprinttype = {ECCC},
eprint = {TR18-109},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LarsenN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LeviW18,
author = {Amit Levi and
Erik Waingarten},
title = {Lower Bounds for Tolerant Junta and Unateness Testing via Rejection
Sampling of Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-094}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/094},
eprinttype = {ECCC},
eprint = {TR18-094},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LeviW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Li18,
author = {Xin Li},
title = {Pseudorandom Correlation Breakers, Independence Preserving Mergers
and their Applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-028}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/028},
eprinttype = {ECCC},
eprint = {TR18-028},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Li18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LiLZ18,
author = {Xin Li and
Shachar Lovett and
Jiapeng Zhang},
title = {Sunflowers and Quasi-sunflowers from Randomness Extractors},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-082}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/082},
eprinttype = {ECCC},
eprint = {TR18-082},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LiLZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LiZ18,
author = {Fu Li and
David Zuckerman},
title = {Improved Extractors for Recognizable and Algebraic Sources},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-110}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/110},
eprinttype = {ECCC},
eprint = {TR18-110},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LiZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LimayeSSTV18,
author = {Nutan Limaye and
Karteek Sreenivasaiah and
Srikanth Srinivasan and
Utkarsh Tripathi and
S. Venkitesh},
title = {The Coin Problem in Constant Depth: Sample Complexity and Parity gates},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-157}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/157},
eprinttype = {ECCC},
eprint = {TR18-157},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LimayeSSTV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Lingas18,
author = {Andrzej Lingas},
title = {Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms
Require Logarithmic Conjunction-depth},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-108}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/108},
eprinttype = {ECCC},
eprint = {TR18-108},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Lingas18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LoffM18,
author = {Bruno Loff and
Sagnik Mukhopadhyay},
title = {Lifting Theorems for Equality},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-175}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/175},
eprinttype = {ECCC},
eprint = {TR18-175},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LoffM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Lovett18,
author = {Shachar Lovett},
title = {A proof of the {GM-MDS} conjecture},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-047}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/047},
eprinttype = {ECCC},
eprint = {TR18-047},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Lovett18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LovettZ18,
author = {Shachar Lovett and
Jiapeng Zhang},
title = {{DNF} sparsification beyond sunflowers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-190}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/190},
eprinttype = {ECCC},
eprint = {TR18-190},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LovettZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MahajanNT18,
author = {Meena Mahajan and
Prajakta Nimbhorkar and
Anuj Tawari},
title = {Computing the maximum using (min, +) formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-020}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/020},
eprinttype = {ECCC},
eprint = {TR18-020},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MahajanNT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MahajanNT18a,
author = {Meena Mahajan and
Prajakta Nimbhorkar and
Anuj Tawari},
title = {Shortest path length with bounded-alternation (min, +) formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-146}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/146},
eprinttype = {ECCC},
eprint = {TR18-146},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MahajanNT18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MekaRT18,
author = {Raghu Meka and
Omer Reingold and
Avishay Tal},
title = {Pseudorandom Generators for Width-3 Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-112}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/112},
eprinttype = {ECCC},
eprint = {TR18-112},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MekaRT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/NakarR18,
author = {Yonatan Nakar and
Dana Ron},
title = {On the Testability of Graph Partition Properties},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-185}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/185},
eprinttype = {ECCC},
eprint = {TR18-185},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/NakarR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/NaorPY18,
author = {Moni Naor and
Merav Parter and
Eylon Yogev},
title = {The Power of Distributed Verifiers in Interactive Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-213}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/213},
eprinttype = {ECCC},
eprint = {TR18-213},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/NaorPY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/NelsonY18,
author = {Jelani Nelson and
Huacheng Yu},
title = {Optimal Lower Bounds for Distributed and Streaming Spanning Forest
Computation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-129}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/129},
eprinttype = {ECCC},
eprint = {TR18-129},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/NelsonY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ODonnellST18,
author = {Ryan O'Donnell and
Rocco A. Servedio and
Li{-}Yang Tan},
title = {Fooling Polytopes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-145}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/145},
eprinttype = {ECCC},
eprint = {TR18-145},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ODonnellST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/OjhaT18,
author = {Aayush Ojha and
Raghunath Tewari},
title = {Circuit Complexity of Bounded Planar Cutwidth Graph Matching},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-004}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/004},
eprinttype = {ECCC},
eprint = {TR18-004},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/OjhaT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/OliveiraPS18,
author = {Igor Carboni Oliveira and
J{\'{a}}n Pich and
Rahul Santhanam},
title = {Hardness magnification near state-of-the-art lower bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-158}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/158},
eprinttype = {ECCC},
eprint = {TR18-158},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/OliveiraPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/OliveiraS18,
author = {Igor Carboni Oliveira and
Rahul Santhanam},
title = {Pseudo-derandomizing learning and approximation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-122}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/122},
eprinttype = {ECCC},
eprint = {TR18-122},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/OliveiraS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/OliveiraS18a,
author = {Igor Carboni Oliveira and
Rahul Santhanam},
title = {Hardness Magnification for Natural Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-139}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/139},
eprinttype = {ECCC},
eprint = {TR18-139},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/OliveiraS18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/OliveiraST18,
author = {Igor Carboni Oliveira and
Rahul Santhanam and
Roei Tell},
title = {Expander-Based Cryptography Meets Natural Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-159}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/159},
eprinttype = {ECCC},
eprint = {TR18-159},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/OliveiraST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PartT18,
author = {Fedor Part and
Iddo Tzameret},
title = {Resolution with Counting: Lower Bounds over Different Moduli},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-117}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/117},
eprinttype = {ECCC},
eprint = {TR18-117},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PartT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PayC18,
author = {Tayfun Pay and
James L. Cox},
title = {An overview of some semantic and syntactic complexity classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-166}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/166},
eprinttype = {ECCC},
eprint = {TR18-166},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PayC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PersianoY18,
author = {Giuseppe Persiano and
Kevin Yeo},
title = {Lower Bounds for Differentially Private RAMs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-181}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/181},
eprinttype = {ECCC},
eprint = {TR18-181},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PersianoY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RahmanW18,
author = {Md Lutfar Rahman and
Thomas Watson},
title = {Complexity of Unordered {CNF} Games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-039}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/039},
eprinttype = {ECCC},
eprint = {TR18-039},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RahmanW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RaskhodnikovaRV18,
author = {Sofya Raskhodnikova and
Noga Ron{-}Zewi and
Nithin Varma},
title = {Erasures versus Errors in Local Decoding and Property Testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-195}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/195},
eprinttype = {ECCC},
eprint = {TR18-195},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RaskhodnikovaRV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RazT18,
author = {Ran Raz and
Avishay Tal},
title = {Oracle Separation of {BQP} and {PH}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-107}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/107},
eprinttype = {ECCC},
eprint = {TR18-107},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RazT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ReingoldRR18,
author = {Omer Reingold and
Guy N. Rothblum and
Ron Rothblum},
title = {Efficient Batch Verification for {UP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-022}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/022},
eprinttype = {ECCC},
eprint = {TR18-022},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ReingoldRR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RomashchenkoZ18,
author = {Andrei E. Romashchenko and
Marius Zimand},
title = {An operational characterization of mutual information in algorithmic
information theory},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-043}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/043},
eprinttype = {ECCC},
eprint = {TR18-043},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RomashchenkoZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Roughgarden18,
author = {Tim Roughgarden},
title = {Complexity Theory, Game Theory, and Economics},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-001}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/001},
eprinttype = {ECCC},
eprint = {TR18-001},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Roughgarden18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SM18,
author = {{Karthik {C. S.}} and
Pasin Manurangsi},
title = {On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-210}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/210},
eprinttype = {ECCC},
eprint = {TR18-210},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Saglam18,
author = {Mert Saglam},
title = {Near log-convexity of measured heat in (discrete) time and consequences},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-144}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/144},
eprinttype = {ECCC},
eprint = {TR18-144},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Saglam18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Samorodnitsky18,
author = {Alex Samorodnitsky},
title = {An upper bound on {\textdollar}{\textbackslash}ell{\_}q{\textdollar}
norms of noisy functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-168}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/168},
eprinttype = {ECCC},
eprint = {TR18-168},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Samorodnitsky18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Sanyal18,
author = {Swagato Sanyal},
title = {A Composition Theorem via Conflict Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-014}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/014},
eprinttype = {ECCC},
eprint = {TR18-014},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Sanyal18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Scheder18,
author = {Dominik Scheder},
title = {{PPSZ} for k {\(\geq\)} 5: More Is Better},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-113}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/113},
eprinttype = {ECCC},
eprint = {TR18-113},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Scheder18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Scheder18a,
author = {Dominik Scheder},
title = {{PPSZ} on {CSP} Instances with Multiple Solutions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-179}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/179},
eprinttype = {ECCC},
eprint = {TR18-179},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Scheder18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SdroievskiSV18,
author = {Nicollas M. Sdroievski and
Murilo V. G. da Silva and
Andr{\'{e}} Lu{\'{\i}}s Vignatti},
title = {The Hidden Subgroup Problem and {MKTP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-193}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/193},
eprinttype = {ECCC},
eprint = {TR18-193},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SdroievskiSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Sherstov18,
author = {Alexander A. Sherstov},
title = {Algorithmic polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-010}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/010},
eprinttype = {ECCC},
eprint = {TR18-010},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Sherstov18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SinhaW18,
author = {Sandip Sinha and
Omri Weinstein},
title = {Local Decodability of the Burrows-Wheeler Transform},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-141}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/141},
eprinttype = {ECCC},
eprint = {TR18-141},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SinhaW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SinhaW18a,
author = {Makrand Sinha and
Ronald de Wolf},
title = {Exponential Separation between Quantum Communication and Logarithm
of Approximate Rank},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-204}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/204},
eprinttype = {ECCC},
eprint = {TR18-204},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SinhaW18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SongWZ18,
author = {Zhao Song and
David P. Woodruff and
Peilin Zhong},
title = {Relative Error Tensor Low Rank Approximation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-103}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/103},
eprinttype = {ECCC},
eprint = {TR18-103},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SongWZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Swernofsky18,
author = {Joseph Swernofsky},
title = {Tensor Rank is Hard to Approximate},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-086}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/086},
eprinttype = {ECCC},
eprint = {TR18-086},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Swernofsky18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Tang18,
author = {Ewin Tang},
title = {A quantum-inspired classical algorithm for recommendation systems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-128}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/128},
eprinttype = {ECCC},
eprint = {TR18-128},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Tang18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Tell18,
author = {Roei Tell},
title = {Proving that prBPP=prP is as hard as "almost" proving that {P} {\(\not =\)}
{NP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-003}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/003},
eprinttype = {ECCC},
eprint = {TR18-003},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Tell18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/TzameretC18,
author = {Iddo Tzameret and
Stephen A. Cook},
title = {Uniform, Integral and Feasible Proofs for the Determinant Identities},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-184}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/184},
eprinttype = {ECCC},
eprint = {TR18-184},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/TzameretC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Viola18,
author = {Emanuele Viola},
title = {Sampling lower bounds: boolean average-case and permutations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-060}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/060},
eprinttype = {ECCC},
eprint = {TR18-060},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Viola18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Viola18a,
author = {Emanuele Viola},
title = {Constant-error pseudorandomness proofs from hardness require majority},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-133}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/133},
eprinttype = {ECCC},
eprint = {TR18-133},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Viola18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Viola18b,
author = {Emanuele Viola},
title = {Lower bounds for data structures with space close to maximum imply
circuit lower bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-186}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/186},
eprinttype = {ECCC},
eprint = {TR18-186},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Viola18b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Viola18c,
author = {Emanuele Viola},
title = {{AC0} unpredictability},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-209}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/209},
eprinttype = {ECCC},
eprint = {TR18-209},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Viola18c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Volkovich18,
author = {Ilya Volkovich},
title = {A story of {AM} and Unique-SAT},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-088}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/088},
eprinttype = {ECCC},
eprint = {TR18-088},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Volkovich18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Watson18,
author = {Thomas Watson},
title = {Amplification with One {NP} Oracle Query},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-058}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/058},
eprinttype = {ECCC},
eprint = {TR18-058},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Watson18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Wigderson18,
author = {Avi Wigderson},
title = {On the nature of the Theory of Computation (ToC)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-072}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/072},
eprinttype = {ECCC},
eprint = {TR18-072},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Wigderson18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Wu18,
author = {Xinyu Wu},
title = {A stochastic calculus approach to the oracle separation of {BQP} and
{PH}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-202}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/202},
eprinttype = {ECCC},
eprint = {TR18-202},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Wu18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Yehudayoff18,
author = {Amir Yehudayoff},
title = {Separating Monotone {VP} and {VNP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-124}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/124},
eprinttype = {ECCC},
eprint = {TR18-124},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Yehudayoff18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Yehudayoff18a,
author = {Amir Yehudayoff},
title = {Anti-concentration in most directions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-194}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/194},
eprinttype = {ECCC},
eprint = {TR18-194},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Yehudayoff18a.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-04-25 09:11 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:
