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/eccc26.bht:"
download as .bib file
@article{DBLP:journals/eccc/AaronsonGS19,
author = {Scott Aaronson and
Daniel Grier and
Luke Schaeffer},
title = {A Quantum Query Complexity Trichotomy for Regular Languages},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-061}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/061},
eprinttype = {ECCC},
eprint = {TR19-061},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AaronsonGS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AaronsonKKT19,
author = {Scott Aaronson and
Robin Kothari and
William Kretschmer and
Justin Thaler},
title = {Quantum Lower Bounds for Approximate Counting via Laurent Polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-062}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/062},
eprinttype = {ECCC},
eprint = {TR19-062},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AaronsonKKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AaronsonR19,
author = {Scott Aaronson and
Guy N. Rothblum},
title = {Gentle Measurement of Quantum States and Differential Privacy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-060}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/060},
eprinttype = {ECCC},
eprint = {TR19-060},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AaronsonR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AcharyaCHST19,
author = {Jayadev Acharya and
Cl{\'{e}}ment L. Canonne and
Yanjun Han and
Ziteng Sun and
Himanshu Tyagi},
title = {Domain Compression and its Application to Randomness-Optimal Distributed
Goodness-of-Fit},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-098}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/098},
eprinttype = {ECCC},
eprint = {TR19-098},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AcharyaCHST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AggarwalGORS19,
author = {Divesh Aggarwal and
Siyao Guo and
Maciej Obremski and
Jo{\~{a}}o Ribeiro and
Noah Stephens{-}Davidowitz},
title = {Extractor Lower Bounds, Revisited},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-173}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/173},
eprinttype = {ECCC},
eprint = {TR19-173},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/AggarwalGORS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Agrawal19,
author = {Rohit Agrawal},
title = {Samplers and extractors for unbounded functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-059}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/059},
eprinttype = {ECCC},
eprint = {TR19-059},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Agrawal19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Agrawal19a,
author = {Rohit Agrawal},
title = {Coin Theorems and the Fourier Expansion},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-087}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/087},
eprinttype = {ECCC},
eprint = {TR19-087},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Agrawal19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AharonovG19,
author = {Dorit Aharonov and
Alex Bredariol Grilo},
title = {Stoquastic {PCP} vs. Randomness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-010}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/010},
eprinttype = {ECCC},
eprint = {TR19-010},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AharonovG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlekseevGHT19,
author = {Yaroslav Alekseev and
Dima Grigoriev and
Edward A. Hirsch and
Iddo Tzameret},
title = {Semi-Algebraic Proofs, {IPS} Lower Bounds and the {\textdollar}{\textbackslash}tau{\textdollar}-Conjecture:
Can a Natural Number be Negative?},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-142}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/142},
eprinttype = {ECCC},
eprint = {TR19-142},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlekseevGHT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AllenderCDM19,
author = {Eric Allender and
Archit Chauhan and
Samir Datta and
Anish Mukherjee},
title = {Planarity, Exclusivity, and Unambiguity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-039}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/039},
eprinttype = {ECCC},
eprint = {TR19-039},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AllenderCDM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlrabiahG19,
author = {Omar Alrabiah and
Venkatesan Guruswami},
title = {An Exponential Lower Bound on the Sub-Packetization of {MSR} Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-005}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/005},
eprinttype = {ECCC},
eprint = {TR19-005},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlrabiahG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlweissLWZ19,
author = {Ryan Alweiss and
Shachar Lovett and
Kewen Wu and
Jiapeng Zhang},
title = {Improved bounds for the sunflower lemma},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-110}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/110},
eprinttype = {ECCC},
eprint = {TR19-110},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlweissLWZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ApplebaumK19,
author = {Benny Applebaum and
Eliran Kachlon},
title = {Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced
Expanders},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-011}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/011},
eprinttype = {ECCC},
eprint = {TR19-011},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ApplebaumK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ArnonR19,
author = {Gal Arnon and
Guy N. Rothblum},
title = {On Prover-Efficient Public-Coin Emulation of Interactive Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-176}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/176},
eprinttype = {ECCC},
eprint = {TR19-176},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ArnonR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ArunachalamGS19,
author = {Srinivasan Arunachalam and
Alex Bredariol Grilo and
Aarthi Sundaram},
title = {Quantum hardness of learning shallow classical circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-041}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/041},
eprinttype = {ECCC},
eprint = {TR19-041},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ArunachalamGS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ArvindCDM19,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {Efficient Black-Box Identity Testing for Free Group Algebra},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-063}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/063},
eprinttype = {ECCC},
eprint = {TR19-063},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ArvindCDM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AshidaINPVW19,
author = {Ryo Ashida and
Tatsuya Imai and
Kotaro Nakagawa and
A. Pavan and
N. V. Vinodchandran and
Osamu Watanabe},
title = {A Sublinear-space and Polynomial-time Separator Algorithm for Planar
Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-091}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/091},
eprinttype = {ECCC},
eprint = {TR19-091},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AshidaINPVW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AustrinBH19,
author = {Per Austrin and
Jonah Brown{-}Cohen and
Johan H{\aa}stad},
title = {Optimal Inapproximability with Universal Factor Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-151}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/151},
eprinttype = {ECCC},
eprint = {TR19-151},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AustrinBH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AustrinBP19,
author = {Per Austrin and
Amey Bhangale and
Aditya Potukuchi},
title = {Simplified inpproximability of hypergraph coloring via t-agreeing
families},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-048}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/048},
eprinttype = {ECCC},
eprint = {TR19-048},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AustrinBP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BallGM19,
author = {Marshall Ball and
Oded Goldreich and
Tal Malkin},
title = {Randomness Extraction from Somewhat Dependent Sources},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-183}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/183},
eprinttype = {ECCC},
eprint = {TR19-183},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/BallGM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BannachHRT19,
author = {Max Bannach and
Zacharias Heinrich and
R{\"{u}}diger Reischuk and
Till Tantau},
title = {Dynamic Kernels for Hitting Sets and Set Packing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-146}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/146},
eprinttype = {ECCC},
eprint = {TR19-146},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BannachHRT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-EliezerCLW19,
author = {Omri Ben{-}Eliezer and
Cl{\'{e}}ment L. Canonne and
Shoham Letzter and
Erik Waingarten},
title = {Finding monotone patterns in sublinear time},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-134}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/134},
eprinttype = {ECCC},
eprint = {TR19-134},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-EliezerCLW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-SassonGKS19,
author = {Eli Ben{-}Sasson and
Lior Goldberg and
Swastik Kopparty and
Shubhangi Saraf},
title = {{DEEP-FRI:} Sampling Outside the Box Improves Soundness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-044}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/044},
eprinttype = {ECCC},
eprint = {TR19-044},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonGKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BenjaminiG19,
author = {Itai Benjamini and
Oded Goldreich},
title = {Pseudo-Mixing Time of Random Walks},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-078}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/078},
eprinttype = {ECCC},
eprint = {TR19-078},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BenjaminiG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BermanDRV19,
author = {Itay Berman and
Akshay Degwekar and
Ron D. Rothblum and
Prashant Nalini Vasudevan},
title = {Statistical Difference Beyond the Polarizing Regime},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-038}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/038},
eprinttype = {ECCC},
eprint = {TR19-038},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BermanDRV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BermanHT19,
author = {Itay Berman and
Iftach Haitner and
Eliad Tsfadia},
title = {A Tight Parallel-Repetition Theorem for Random-Terminating Interactive
Arguments},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-049}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/049},
eprinttype = {ECCC},
eprint = {TR19-049},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BermanHT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffB19,
author = {Olaf Beyersdorff and
Joshua Blinkhorn},
title = {Proof Complexity of Symmetry Learning in {QBF}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-057}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/057},
eprinttype = {ECCC},
eprint = {TR19-057},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhandariC19,
author = {Siddharth Bhandari and
Sayantan Chakraborty},
title = {Improved bounds for perfect sampling of {\textdollar}k{\textdollar}-colorings
in graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-164}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/164},
eprinttype = {ECCC},
eprint = {TR19-164},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhandariC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhangaleK19,
author = {Amey Bhangale and
Subhash Khot},
title = {UG-hardness to NP-hardness by Losing Half},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-004}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/004},
eprinttype = {ECCC},
eprint = {TR19-004},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhangaleK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhangaleK19a,
author = {Amey Bhangale and
Subhash Khot},
title = {Simultaneous Max-Cut is harder to approximate than Max-Cut},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-148}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/148},
eprinttype = {ECCC},
eprint = {TR19-148},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhangaleK19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhargavaSV19,
author = {Vishwas Bhargava and
Shubhangi Saraf and
Ilya Volkovich},
title = {Reconstruction of Depth-{\textdollar}4{\textdollar} Multilinear Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-104}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/104},
eprinttype = {ECCC},
eprint = {TR19-104},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhargavaSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhattacharyyaBE19,
author = {Arnab Bhattacharyya and
{\'{E}}douard Bonnet and
L{\'{a}}szl{\'{o}} Egri and
Suprovat Ghoshal and
{Karthik {C. S.}} and
Bingkai Lin and
Pasin Manurangsi and
D{\'{a}}niel Marx},
title = {Parameterized Intractability of Even Set and Shortest Vector Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-115}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/115},
eprinttype = {ECCC},
eprint = {TR19-115},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhattacharyyaBE19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhattacharyyaJG19,
author = {Arnab Bhattacharyya and
Philips George John and
Suprovat Ghoshal and
Raghu Meka},
title = {Average Bias and Polynomial Sources},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-079}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/079},
eprinttype = {ECCC},
eprint = {TR19-079},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhattacharyyaJG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlancLT19,
author = {Guy Blanc and
Jane Lange and
Li{-}Yang Tan},
title = {Top-down induction of decision trees: rigorous guarantees and inherent
limitations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-166}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/166},
eprinttype = {ECCC},
eprint = {TR19-166},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlancLT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BodwinG19,
author = {Greg Bodwin and
Ofer Grossman},
title = {Strategy-Stealing is Non-Constructive},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-185}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/185},
eprinttype = {ECCC},
eprint = {TR19-185},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BodwinG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovMTW19,
author = {Andrej Bogdanov and
Nikhil S. Mande and
Justin Thaler and
Christopher Williamson},
title = {Approximate degree, secret sharing, and concentration phenomena},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-082}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/082},
eprinttype = {ECCC},
eprint = {TR19-082},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovMTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakensiekG19,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {Bridging between 0/1 and Linear Programming via Random Walks},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-054}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/054},
eprinttype = {ECCC},
eprint = {TR19-054},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakensiekG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakensiekGG19,
author = {Joshua Brakensiek and
Sivakanth Gopi and
Venkatesan Guruswami},
title = {CSPs with Global Modular Constraints: Algorithms and Hardness via
Polynomial Representations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-013}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/013},
eprinttype = {ECCC},
eprint = {TR19-013},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakensiekGG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanKM19,
author = {Mark Braverman and
Subhash Khot and
Dor Minzer},
title = {On Rich {\textdollar}2{\textdollar}-to-{\textdollar}1{\textdollar}
Games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-141}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/141},
eprinttype = {ECCC},
eprint = {TR19-141},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanKM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty19,
author = {Nader H. Bshouty},
title = {Almost Optimal Testers for Concise Representations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-156}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/156},
eprinttype = {ECCC},
eprint = {TR19-156},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BunMT19,
author = {Mark Bun and
Nikhil S. Mande and
Justin Thaler},
title = {Sign-Rank Can Increase Under Intersection},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-027}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/027},
eprinttype = {ECCC},
eprint = {TR19-027},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BunMT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BydzovskyOK19,
author = {Jan Bydzovsky and
Igor Carboni Oliveira and
Jan Kraj{\'{\i}}cek},
title = {Consistency of circuit lower bounds with bounded theories},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-077}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/077},
eprinttype = {ECCC},
eprint = {TR19-077},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BydzovskyOK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CanonneCKLW19,
author = {Cl{\'{e}}ment L. Canonne and
Xi Chen and
Gautam Kamath and
Amit Levi and
Erik Waingarten},
title = {Random Restrictions of High-Dimensional Distributions and Uniformity
Testing with Subcube Conditioning},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-165}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/165},
eprinttype = {ECCC},
eprint = {TR19-165},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CanonneCKLW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabartiG19,
author = {Amit Chakrabarti and
Prantar Ghosh},
title = {Streaming Verification of Graph Computations via Graph Structure},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-101}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/101},
eprinttype = {ECCC},
eprint = {TR19-101},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabartiG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabortyCMP19,
author = {Sourav Chakraborty and
Arkadev Chattopadhyay and
Nikhil S. Mande and
Manaswi Paraashar},
title = {Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-136}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/136},
eprinttype = {ECCC},
eprint = {TR19-136},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabortyCMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChatterjeeKSV19,
author = {Prerona Chatterjee and
Mrinal Kumar and
Adrian She and
Ben Lee Volk},
title = {A Quadratic Lower Bound for Algebraic Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-170}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/170},
eprinttype = {ECCC},
eprint = {TR19-170},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChatterjeeKSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayFK19,
author = {Arkadev Chattopadhyay and
Yuval Filmus and
Sajin Koroth and
Or Meir and
Toniann Pitassi},
title = {Query-to-Communication Lifting Using Low-Discrepancy Gadgets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-103}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/103},
eprinttype = {ECCC},
eprint = {TR19-103},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayFK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayGG19,
author = {Eshan Chattopadhyay and
Jesse Goodman and
Vipul Goyal and
Xin Li},
title = {Extractors for Adversarial Sources via Extremal Hypergraphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-184}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/184},
eprinttype = {ECCC},
eprint = {TR19-184},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayGG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayHH19,
author = {Eshan Chattopadhyay and
Pooya Hatami and
Kaave Hosseini and
Shachar Lovett and
David Zuckerman},
title = {{XOR} Lemmas for Resilient Functions Against Polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-145}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/145},
eprinttype = {ECCC},
eprint = {TR19-145},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayHH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayMM19,
author = {Arkadev Chattopadhyay and
Meena Mahajan and
Nikhil S. Mande and
Nitin Saurabh},
title = {Lower Bounds for Linear Decision Lists},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-007}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/007},
eprinttype = {ECCC},
eprint = {TR19-007},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayMM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChauguleKLMSS19,
author = {Prasad Chaugule and
Mrinal Kumar and
Nutan Limaye and
Chandra Kanta Mohapatra and
Adrian She and
Srikanth Srinivasan},
title = {Schur Polynomials do not have small formulas if the Determinant doesn't!},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-172}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/172},
eprinttype = {ECCC},
eprint = {TR19-172},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChauguleKLMSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Chen19,
author = {Lijie Chen},
title = {Non-deterministic Quasi-Polynomial Time is Average-case Hard for {ACC}
Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-031}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/031},
eprinttype = {ECCC},
eprint = {TR19-031},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Chen19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenG19,
author = {Lijie Chen and
Ofer Grossman},
title = {Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-072}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/072},
eprinttype = {ECCC},
eprint = {TR19-072},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenJW19,
author = {Lijie Chen and
Ce Jin and
Ryan Williams},
title = {Hardness Magnification for all Sparse {NP} Languages},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-118}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/118},
eprinttype = {ECCC},
eprint = {TR19-118},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenJW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenMMW19,
author = {Lijie Chen and
Dylan M. McKay and
Cody Murray and
R. Ryan Williams},
title = {Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton
Theorems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-075}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/075},
eprinttype = {ECCC},
eprint = {TR19-075},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenMMW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenRTY19,
author = {Lijie Chen and
Ron Rothblum and
Roei Tell and
Eylon Yogev},
title = {On Exponential-Time Hypotheses, Derandomization, and Circuit Lower
Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-169}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/169},
eprinttype = {ECCC},
eprint = {TR19-169},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenRTY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CheraghchiKLM19,
author = {Mahdi Cheraghchi and
Valentine Kabanets and
Zhenjian Lu and
Dimitrios Myrisiotis},
title = {Circuit Lower Bounds for {MCSP} from Local Pseudorandom Generators},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-022}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/022},
eprinttype = {ECCC},
eprint = {TR19-022},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CheraghchiKLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChewC19,
author = {Leroy Chew and
Judith Clymo},
title = {The Equivalences of Refutational {QRAT}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-076}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/076},
eprinttype = {ECCC},
eprint = {TR19-076},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChewC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChewC19a,
author = {Leroy Chew and
Judith Clymo},
title = {How {QBF} Expansion Makes Strategy Extraction Hard},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-157}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/157},
eprinttype = {ECCC},
eprint = {TR19-157},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChewC19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChiesaMS19,
author = {Alessandro Chiesa and
Peter Manohar and
Igor Shinkar},
title = {On Local Testability in the Non-Signaling Setting},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-070}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/070},
eprinttype = {ECCC},
eprint = {TR19-070},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChiesaMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChouKS19,
author = {Chi{-}Ning Chou and
Mrinal Kumar and
Noam Solomon},
title = {Closure of {VP} under taking factors: a short and simple proof},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-037}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/037},
eprinttype = {ECCC},
eprint = {TR19-037},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChouKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChoudhuriHKPRR19,
author = {Arka Rai Choudhuri and
Pavel Hub{\'{a}}cek and
Chethan Kamath and
Krzysztof Pietrzak and
Alon Rosen and
Guy N. Rothblum},
title = {Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-074}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/074},
eprinttype = {ECCC},
eprint = {TR19-074},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChoudhuriHKPRR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CohenS19,
author = {Gil Cohen and
Shahar Samocha},
title = {Capacity-Approaching Deterministic Interactive Coding Schemes Against
Adversarial Errors},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-147}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/147},
eprinttype = {ECCC},
eprint = {TR19-147},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CohenS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CrepeauY19,
author = {Claude Cr{\'{e}}peau and
Nan Yang},
title = {Non-Locality in Interactive Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-030}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/030},
eprinttype = {ECCC},
eprint = {TR19-030},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CrepeauY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DhayalI19,
author = {Anant Dhayal and
Russell Impagliazzo},
title = {{UTIME} Easy-witness Lemma {\&} Some Consequences},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-167}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/167},
eprinttype = {ECCC},
eprint = {TR19-167},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DhayalI19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DiksteinD19,
author = {Yotam Dikstein and
Irit Dinur},
title = {Agreement testing theorems on layered set systems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-112}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/112},
eprinttype = {ECCC},
eprint = {TR19-112},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DiksteinD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurG19,
author = {Irit Dinur and
Konstantin Golubev},
title = {Direct sum testing - the general case},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-139}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/139},
eprinttype = {ECCC},
eprint = {TR19-139},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DinurG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurM19,
author = {Irit Dinur and
Roy Meshulam},
title = {Near Coverings and Cosystolic Expansion - an example of topological
property testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-126}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/126},
eprinttype = {ECCC},
eprint = {TR19-126},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DinurM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DoronHH19,
author = {Dean Doron and
Pooya Hatami and
William Hoza},
title = {Log-Seed Pseudorandom Generators via Iterated Restrictions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-149}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/149},
eprinttype = {ECCC},
eprint = {TR19-149},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DoronHH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DoronMOZ19,
author = {Dean Doron and
Dana Moshkovitz and
Justin Oh and
David Zuckerman},
title = {Nearly Optimal Pseudorandomness From Hardness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-099}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/099},
eprinttype = {ECCC},
eprint = {TR19-099},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DoronMOZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DoronTT19,
author = {Dean Doron and
Amnon Ta{-}Shma and
Roei Tell},
title = {On Hitting-Set Generators for Polynomials that Vanish Rarely},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-119}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/119},
eprinttype = {ECCC},
eprint = {TR19-119},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DoronTT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DoseG19,
author = {Titus Dose and
Christian Gla{\ss}er},
title = {NP-Completeness, Proof Systems, and Disjoint NP-Pairs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-050}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/050},
eprinttype = {ECCC},
eprint = {TR19-050},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DoseG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DvirL19,
author = {Zeev Dvir and
Allen Liu},
title = {Fourier and Circulant Matrices are Not Rigid},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-129}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/129},
eprinttype = {ECCC},
eprint = {TR19-129},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DvirL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DwivediMS19,
author = {Ashish Dwivedi and
Rajat Mittal and
Nitin Saxena},
title = {Efficiently factoring polynomials modulo {\textdollar}p4{\textdollar}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-008}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/008},
eprinttype = {ECCC},
eprint = {TR19-008},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DwivediMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DwivediMS19a,
author = {Ashish Dwivedi and
Rajat Mittal and
Nitin Saxena},
title = {Counting basic-irreducible factors mod {\textdollar}pk{\textdollar}
in deterministic poly-time and {\textdollar}p{\textdollar}-adic applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-033}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/033},
eprinttype = {ECCC},
eprint = {TR19-033},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DwivediMS19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/EfremenkoKS19,
author = {Klim Efremenko and
Gillat Kol and
Raghuvansh Saxena},
title = {Noisy Beeps},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-111}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/111},
eprinttype = {ECCC},
eprint = {TR19-111},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/EfremenkoKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/EfremenkoKS19a,
author = {Klim Efremenko and
Gillat Kol and
Raghuvansh Saxena},
title = {Radio Network Coding Requires Logarithmic Overhead},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-132}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/132},
eprinttype = {ECCC},
eprint = {TR19-132},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/EfremenkoKS19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FilmusHHHZ19,
author = {Yuval Filmus and
Lianna Hambardzumyan and
Hamed Hatami and
Pooya Hatami and
David Zuckerman},
title = {Biasing Boolean Functions and Collective Coin-Flipping Protocols over
Arbitrary Product Distributions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-029}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/029},
eprinttype = {ECCC},
eprint = {TR19-029},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FilmusHHHZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FlemingKP19,
author = {Noah Fleming and
Pravesh Kothari and
Toniann Pitassi},
title = {Semialgebraic Proofs and Efficient Algorithm Design},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-106}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/106},
eprinttype = {ECCC},
eprint = {TR19-106},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FlemingKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FournierMST19,
author = {Herv{\'{e}} Fournier and
Guillaume Malod and
Maud Szusterman and
S{\'{e}}bastien Tavenas},
title = {Nonnegative rank measures and monotone algebraic branching programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-100}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/100},
eprinttype = {ECCC},
eprint = {TR19-100},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FournierMST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GalR19,
author = {Anna G{\'{a}}l and
Robert Robere},
title = {Lower Bounds for (Non-monotone) Comparator Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-128}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/128},
eprinttype = {ECCC},
eprint = {TR19-128},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GalR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GalS19,
author = {Anna G{\'{a}}l and
Ridwan Syed},
title = {Upper Bounds on Communication in terms of Approximate Rank},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-006}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/006},
eprinttype = {ECCC},
eprint = {TR19-006},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GalS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GalesiIRS19,
author = {Nicola Galesi and
Dmitry Itsykson and
Artur Riazanov and
Anastasia Sofronova},
title = {Bounded-depth Frege complexity of Tseitin formulas for all graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-069}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/069},
eprinttype = {ECCC},
eprint = {TR19-069},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GalesiIRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GalesiKT19,
author = {Nicola Galesi and
Leszek Aleksander Kolodziejczyk and
Neil Thapen},
title = {Polynomial calculus space and resolution width},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-052}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/052},
eprinttype = {ECCC},
eprint = {TR19-052},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GalesiKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Gao19,
author = {Jiawei Gao},
title = {On the Fine-grained Complexity of Least Weight Subsequence in Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-045}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/045},
eprinttype = {ECCC},
eprint = {TR19-045},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Gao19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GaoI19,
author = {Jiawei Gao and
Russell Impagliazzo},
title = {The Fine-Grained Complexity of Strengthenings of First-Order Logic},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-009}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/009},
eprinttype = {ECCC},
eprint = {TR19-009},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GaoI19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GargGKS19,
author = {Ankit Garg and
Nikhil Gupta and
Neeraj Kayal and
Chandan Saha},
title = {Determinant equivalence test over finite fields and over {\(\mathbb{Q}\)}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-042}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/042},
eprinttype = {ECCC},
eprint = {TR19-042},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GargGKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GargMOW19,
author = {Ankit Garg and
Visu Makam and
Rafael Mendes de Oliveira and
Avi Wigderson},
title = {Search problems in algebraic complexity, GCT, and hardness of generator
for invariant rings},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-140}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/140},
eprinttype = {ECCC},
eprint = {TR19-140},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GargMOW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GargRT19,
author = {Sumegha Garg and
Ran Raz and
Avishay Tal},
title = {Time-Space Lower Bounds for Two-Pass Learning},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-071}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/071},
eprinttype = {ECCC},
eprint = {TR19-071},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GargRT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Garlik19,
author = {Michal Garl{\'{\i}}k},
title = {Resolution Lower Bounds for Refutation Statements},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-084}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/084},
eprinttype = {ECCC},
eprint = {TR19-084},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Garlik19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GhoshalS19,
author = {Suprovat Ghoshal and
Rishi Saket},
title = {Hardness of Learning DNFs using Halfspaces},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-161}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/161},
eprinttype = {ECCC},
eprint = {TR19-161},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GhoshalS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GirishRT19,
author = {Uma Girish and
Ran Raz and
Avishay Tal},
title = {Quantum versus Randomized Communication Complexity, with Efficient
Players},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-152}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/152},
eprinttype = {ECCC},
eprint = {TR19-152},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GirishRT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GishbolinerS19,
author = {Lior Gishboliner and
Asaf Shapira},
title = {Testing Graphs against an Unknown Distribution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-083}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/083},
eprinttype = {ECCC},
eprint = {TR19-083},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GishbolinerS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GlinskihI19,
author = {Ludmila Glinskih and
Dmitry Itsykson},
title = {On Tseitin formulas, read-once branching programs and treewidth},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-020}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/020},
eprinttype = {ECCC},
eprint = {TR19-020},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GlinskihI19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoemansGH19,
author = {Michel X. Goemans and
Shafi Goldwasser and
Dhiraj Holden},
title = {Doubly-Efficient Pseudo-Deterministic Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-135}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/135},
eprinttype = {ECCC},
eprint = {TR19-135},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoemansGH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoldenbergS19,
author = {Elazar Goldenberg and
{Karthik {C. S.}}},
title = {Hardness Amplification of Optimization Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-125}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/125},
eprinttype = {ECCC},
eprint = {TR19-125},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoldenbergS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Goldreich19,
author = {Oded Goldreich},
title = {Multi-pseudodeterministic algorithms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-012}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/012},
eprinttype = {ECCC},
eprint = {TR19-012},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Goldreich19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Goldreich19a,
author = {Oded Goldreich},
title = {On the Complexity of Estimating the Effective Support Size},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-088}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/088},
eprinttype = {ECCC},
eprint = {TR19-088},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Goldreich19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Goldreich19b,
author = {Oded Goldreich},
title = {Testing Isomorphism in the Bounded-Degree Graph Model},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-102}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/102},
eprinttype = {ECCC},
eprint = {TR19-102},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Goldreich19b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Goldreich19c,
author = {Oded Goldreich},
title = {Improved bounds on the AN-complexity of multilinear functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-171}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/171},
eprinttype = {ECCC},
eprint = {TR19-171},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Goldreich19c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoldwasserGMW19,
author = {Shafi Goldwasser and
Ofer Grossman and
Sidhanth Mohanty and
David P. Woodruff},
title = {Pseudo-deterministic Streaming},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-177}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/177},
eprinttype = {ECCC},
eprint = {TR19-177},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoldwasserGMW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GolovnevIIKKT19,
author = {Alexander Golovnev and
Rahul Ilango and
Russell Impagliazzo and
Valentine Kabanets and
Antonina Kolokolova and
Avishay Tal},
title = {AC0[p] Lower Bounds against {MCSP} via the Coin Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-018}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/018},
eprinttype = {ECCC},
eprint = {TR19-018},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GolovnevIIKKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GotlibK19,
author = {Roy Gotlib and
Tali Kaufman},
title = {Testing Odd Direct Sums Using High Dimensional Expanders},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-124}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/124},
eprinttype = {ECCC},
eprint = {TR19-124},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GotlibK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GourdeauKKW19,
author = {Pascale Gourdeau and
Varun Kanade and
Marta Kwiatkowska and
James Worrell},
title = {On the Hardness of Robust Classification},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-123}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/123},
eprinttype = {ECCC},
eprint = {TR19-123},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GourdeauKKW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GriloSY19,
author = {Alex Bredariol Grilo and
William Slofstra and
Henry Yuen},
title = {Perfect zero knowledge for quantum multiprover interactive proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-086}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/086},
eprinttype = {ECCC},
eprint = {TR19-086},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GriloSY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GrossmanKN19,
author = {Tomer Grossman and
Ilan Komargodski and
Moni Naor},
title = {Instance Complexity and Unlabeled Certificates in the Decision Tree
Model},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-113}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/113},
eprinttype = {ECCC},
eprint = {TR19-113},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GrossmanKN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuptaJST19,
author = {Chetan Gupta and
Rahul Jain and
Vimal Raj Sharma and
Raghunath Tewari},
title = {Unambiguous Catalytic Computation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-095}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/095},
eprinttype = {ECCC},
eprint = {TR19-095},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuptaJST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GurL19,
author = {Tom Gur and
Oded Lachish},
title = {A Lower Bound for Relaxed Locally Decodable Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-056}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/056},
eprinttype = {ECCC},
eprint = {TR19-056},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GurL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiHS19,
author = {Venkatesan Guruswami and
Bernhard Haeupler and
Amirbehshad Shahrasbi},
title = {Optimally Resilient Codes for List-Decoding from Insertions and Deletions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-153}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/153},
eprinttype = {ECCC},
eprint = {TR19-153},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiHS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiOS19,
author = {Venkatesan Guruswami and
Jakub Oprsal and
Sai Sandeep},
title = {Revisiting Alphabet Reduction in Dinur's {PCP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-092}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/092},
eprinttype = {ECCC},
eprint = {TR19-092},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiOS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiRY19,
author = {Venkatesan Guruswami and
Andrii Riazanov and
Min Ye},
title = {Ar?kan meets Shannon: Polar codes with near-optimal convergence to
channel capacity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-154}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/154},
eprinttype = {ECCC},
eprint = {TR19-154},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiRY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiS19,
author = {Venkatesan Guruswami and
Sai Sandeep},
title = {Rainbow coloring hardness via low sensitivity polymorphisms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-094}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/094},
eprinttype = {ECCC},
eprint = {TR19-094},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiS19a,
author = {Venkatesan Guruswami and
Sai Sandeep},
title = {{\textdollar}d{\textdollar}-to-{\textdollar}1{\textdollar} Hardness
of Coloring {\textdollar}4{\textdollar}-colorable Graphs with {\textdollar}O(1){\textdollar}
colors},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-116}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/116},
eprinttype = {ECCC},
eprint = {TR19-116},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiS19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HaitnerMSS19,
author = {Iftach Haitner and
Noam Mazor and
Ronen Shaltiel and
Jad Silbak},
title = {Channels of Small Log-Ratio Leakage and Characterization of Two-Party
Differentially Private Computation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-081}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/081},
eprinttype = {ECCC},
eprint = {TR19-081},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HaitnerMSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HarshaKLT19,
author = {Prahladh Harsha and
Subhash Khot and
Euiwoong Lee and
Devanathan Thiruvenkatachari},
title = {Improved 3LIN Hardness via Linear Label Cover},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-093}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/093},
eprinttype = {ECCC},
eprint = {TR19-093},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HarshaKLT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HatamiHL19,
author = {Hamed Hatami and
Kaave Hosseini and
Shachar Lovett},
title = {Sign rank vs Discrepancy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-067}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/067},
eprinttype = {ECCC},
eprint = {TR19-067},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HatamiHL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HiraharaW19,
author = {Shuichi Hirahara and
Osamu Watanabe},
title = {On Nonadaptive Reductions to the Set of Random Strings and Its Dense
Subsets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-025}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/025},
eprinttype = {ECCC},
eprint = {TR19-025},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HiraharaW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Hrubes19,
author = {Pavel Hrubes},
title = {On {\textdollar}{\textbackslash}epsilon{\textdollar}-sensitive monotone
computations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-034}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/034},
eprinttype = {ECCC},
eprint = {TR19-034},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Hrubes19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Hrubes19a,
author = {Pavel Hrubes},
title = {On the complexity of computing a random Boolean function over the
reals},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-036}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/036},
eprinttype = {ECCC},
eprint = {TR19-036},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Hrubes19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HrubesRRY19,
author = {Pavel Hrubes and
Sivaramakrishnan Natarajan Ramamoorthy and
Anup Rao and
Amir Yehudayoff},
title = {Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-026}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/026},
eprinttype = {ECCC},
eprint = {TR19-026},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HrubesRRY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HuangV19,
author = {Xuangui Huang and
Emanuele Viola},
title = {Approximate Degree-Weight and Indistinguishability},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-085}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/085},
eprinttype = {ECCC},
eprint = {TR19-085},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HuangV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ilango19,
author = {Rahul Ilango},
title = {{\textdollar}AC0[p]{\textdollar} Lower Bounds and NP-Hardness for
Variants of {MCSP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-021}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/021},
eprinttype = {ECCC},
eprint = {TR19-021},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ilango19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoMP19,
author = {Russell Impagliazzo and
Sasank Mouli and
Toniann Pitassi},
title = {The Surprising Power of Constant Depth Algebraic Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-024}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/024},
eprinttype = {ECCC},
eprint = {TR19-024},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ItsyksonKRS19,
author = {Dmitry Itsykson and
Alexander Knop and
Andrei E. Romashchenko and
Dmitry Sokolov},
title = {On OBDD-based algorithms and proof systems that dynamically change
order of variables},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-001}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/001},
eprinttype = {ECCC},
eprint = {TR19-001},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ItsyksonKRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ItsyksonRSS19,
author = {Dmitry Itsykson and
Artur Riazanov and
Danil Sagunov and
Petr Smirnov},
title = {Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin
Formulas for All Constant-Degree Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-178}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/178},
eprinttype = {ECCC},
eprint = {TR19-178},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ItsyksonRSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Jaiswal19,
author = {Ragesh Jaiswal},
title = {A note on the relation between {XOR} and Selective {XOR} Lemmas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-105}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/105},
eprinttype = {ECCC},
eprint = {TR19-105},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Jaiswal19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/JuknaS19,
author = {Stasys Jukna and
Hannes Seiwert},
title = {Sorting Can Exponentially Speed Up Pure Dynamic Programming},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-158}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/158},
eprinttype = {ECCC},
eprint = {TR19-158},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/JuknaS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KirshnerS19,
author = {Naomi Kirshner and
Alex Samorodnitsky},
title = {A moment ratio bound for polynomials and some extremal properties
of Krawchouk polynomials and Hamming spheres},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-130}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/130},
eprinttype = {ECCC},
eprint = {TR19-130},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KirshnerS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KoW19,
author = {Young Ko and
Omri Weinstein},
title = {An Adaptive Step Toward the Multiphase Conjecture},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-144}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/144},
eprinttype = {ECCC},
eprint = {TR19-144},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KoW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KolisettyLVY19,
author = {Sanjana Kolisetty and
Linh Le and
Ilya Volkovich and
Mihalis Yannakakis},
title = {The Complexity of Finding \emph{S}-factors in Regular Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-040}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/040},
eprinttype = {ECCC},
eprint = {TR19-040},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KolisettyLVY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KoppartyRRSS19,
author = {Swastik Kopparty and
Nicolas Resch and
Noga Ron{-}Zewi and
Shubhangi Saraf and
Shashwat Silas},
title = {On List Recovery of High-Rate Tensor Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-080}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/080},
eprinttype = {ECCC},
eprint = {TR19-080},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KoppartyRRSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KouckyRT19,
author = {Michal Kouck{\'{y}} and
Vojtech R{\"{o}}dl and
Navid Talebanfard},
title = {A Separator Theorem for Hypergraphs and a {CSP-SAT} Algorithm},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-181}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/181},
eprinttype = {ECCC},
eprint = {TR19-181},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KouckyRT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Kretschmer19,
author = {William Kretschmer},
title = {{QMA} Lower Bounds for Approximate Counting},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-015}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/015},
eprinttype = {ECCC},
eprint = {TR19-015},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Kretschmer19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KrokhinO19,
author = {Andrei A. Krokhin and
Jakub Oprsal},
title = {The complexity of 3-colouring \emph{H}-colourable graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-053}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/053},
eprinttype = {ECCC},
eprint = {TR19-053},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KrokhinO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KulikovMMP19,
author = {Alexander S. Kulikov and
Ivan Mikhailin and
Andrey Mokhov and
Vladimir V. Podolskii},
title = {Complexity of Linear Operators},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-002}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/002},
eprinttype = {ECCC},
eprint = {TR19-002},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KulikovMMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarOS19,
author = {Mrinal Kumar and
Rafael Mendes de Oliveira and
Ramprasad Saptharishi},
title = {Towards Optimal Depth Reductions for Syntactically Multilinear Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-019}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/019},
eprinttype = {ECCC},
eprint = {TR19-019},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarOS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarSS19,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
title = {andom walks and forbidden minors {II:} {A} poly(d{\(\epsilon\)}\({}^{\mbox{-1}}\)){\textdollar}-query
tester for minor-closed properties of bounded degree graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-046}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/046},
eprinttype = {ECCC},
eprint = {TR19-046},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarSS19a,
author = {Mrinal Kumar and
Ramprasad Saptharishi and
Noam Solomon},
title = {Derandomization from Algebraic Hardness: Treading the Borders},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-065}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/065},
eprinttype = {ECCC},
eprint = {TR19-065},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarSS19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarV19,
author = {Mrinal Kumar and
Ben Lee Volk},
title = {Lower Bounds for Matrix Factorization},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-047}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/047},
eprinttype = {ECCC},
eprint = {TR19-047},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LarsenMWY19,
author = {Kasper Green Larsen and
Tal Malkin and
Omri Weinstein and
Kevin Yeo},
title = {Lower Bounds for Oblivious Near-Neighbor Search},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-055}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/055},
eprinttype = {ECCC},
eprint = {TR19-055},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LarsenMWY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Lee19,
author = {Chin Ho Lee},
title = {Fourier bounds and pseudorandom generators for product tests},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-017}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/017},
eprinttype = {ECCC},
eprint = {TR19-017},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Lee19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LenzRSY19,
author = {Andreas Lenz and
Cyrus Rashtchian and
Paul H. Siegel and
Eitan Yaakobi},
title = {Covering Codes for Insertions and Deletions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-180}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/180},
eprinttype = {ECCC},
eprint = {TR19-180},
timestamp = {Wed, 16 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LenzRSY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LimayeST19,
author = {Nutan Limaye and
Srikanth Srinivasan and
Utkarsh Tripathi},
title = {More on {\textdollar}AC0[{\textbackslash}oplus]{\textdollar} and Variants
of the Majority Function},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-133}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/133},
eprinttype = {ECCC},
eprint = {TR19-133},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LimayeST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LovettSZ19,
author = {Shachar Lovett and
Noam Solomon and
Jiapeng Zhang},
title = {From {DNF} compression to sunflower theorems via regularity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-028}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/028},
eprinttype = {ECCC},
eprint = {TR19-028},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LovettSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LovettWZ19,
author = {Shachar Lovett and
Kewen Wu and
Jiapeng Zhang},
title = {Decision list compression by mild random restrictions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-137}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/137},
eprinttype = {ECCC},
eprint = {TR19-137},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LovettWZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MakamW19,
author = {Visu Makam and
Avi Wigderson},
title = {Singular tuples of matrices is not a null cone (and, the symmetries
of algebraic varieties)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-114}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/114},
eprinttype = {ECCC},
eprint = {TR19-114},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MakamW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Meir19,
author = {Or Meir},
title = {Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-120}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/120},
eprinttype = {ECCC},
eprint = {TR19-120},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Meir19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MeirNPRR19,
author = {Or Meir and
Jakob Nordstr{\"{o}}m and
Toniann Pitassi and
Robert Robere and
Susanna F. de Rezende},
title = {Lifting with Simple Gadgets and Applications to Circuit and Proof
Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-186}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/186},
eprinttype = {ECCC},
eprint = {TR19-186},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MeirNPRR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Milovanov19,
author = {Alexey Milovanov},
title = {{PIT} for depth-4 circuits and Sylvester-Gallai theorem for polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-035}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/035},
eprinttype = {ECCC},
eprint = {TR19-035},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Milovanov19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MosheiffRRSW19,
author = {Jonathan Mosheiff and
Nicolas Resch and
Noga Ron{-}Zewi and
Shashwat Silas and
Mary Wootters},
title = {{LDPC} Codes Achieve List-Decoding Capacity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-122}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/122},
eprinttype = {ECCC},
eprint = {TR19-122},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MosheiffRRSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Oliveira19,
author = {Igor Carboni Oliveira},
title = {Randomness and Intractability in Kolmogorov Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-064}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/064},
eprinttype = {ECCC},
eprint = {TR19-064},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Oliveira19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/OliveiraCHPRS19,
author = {Igor Carboni Oliveira and
Lijie Chen and
Shuichi Hirahara and
J{\'{a}}n Pich and
Ninad Rajgopal and
Rahul Santhanam},
title = {Beyond Natural Proofs: Hardness Magnification and Locality},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-168}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/168},
eprinttype = {ECCC},
eprint = {TR19-168},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/OliveiraCHPRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/OliveiraSS19,
author = {Igor Carboni Oliveira and
Rahul Santhanam and
Srikanth Srinivasan},
title = {Parity helps to compute Majority},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-073}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/073},
eprinttype = {ECCC},
eprint = {TR19-073},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/OliveiraSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PallavoorRW19,
author = {Ramesh Krishnan S. Pallavoor and
Sofya Raskhodnikova and
Erik Waingarten},
title = {Approximating the Distance to Monotonicity of Boolean Functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-163}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/163},
eprinttype = {ECCC},
eprint = {TR19-163},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PallavoorRW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Pang19,
author = {Shuo Pang},
title = {Large Clique is Hard on Average for Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-068}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/068},
eprinttype = {ECCC},
eprint = {TR19-068},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Pang19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Paradise19,
author = {Orr Paradise},
title = {Smooth and Strong PCPs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-023}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/023},
eprinttype = {ECCC},
eprint = {TR19-023},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Paradise19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PitassiSW19,
author = {Toniann Pitassi and
Morgan Shirley and
Thomas Watson},
title = {Nondeterministic and Randomized Boolean Hierarchies in Communication
Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-043}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/043},
eprinttype = {ECCC},
eprint = {TR19-043},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PitassiSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Potukuchi19,
author = {Aditya Potukuchi},
title = {On the AC\({}^{\mbox{0}}\)[{\(\oplus\)}] complexity of Andreev's Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-096}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/096},
eprinttype = {ECCC},
eprint = {TR19-096},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Potukuchi19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PudlakR19,
author = {Pavel Pudl{\'{a}}k and
Vojtech R{\"{o}}dl},
title = {Extractors for small zero-fixing sources},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-058}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/058},
eprinttype = {ECCC},
eprint = {TR19-058},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PudlakR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RahmanW19,
author = {Md Lutfar Rahman and
Thomas Watson},
title = {Tractable Unordered 3-CNF Games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-160}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/160},
eprinttype = {ECCC},
eprint = {TR19-160},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RahmanW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RamamoorthyR19,
author = {Sivaramakrishnan Natarajan Ramamoorthy and
Cyrus Rashtchian},
title = {Equivalence of Systematic Linear Data Structures and Matrix Rigidity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-143}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/143},
eprinttype = {ECCC},
eprint = {TR19-143},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RamamoorthyR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RazZ19,
author = {Ran Raz and
Wei Zhan},
title = {The Random-Query Model and the Memory-Bounded Coupon Collector},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-162}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/162},
eprinttype = {ECCC},
eprint = {TR19-162},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RazZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Remscrim19,
author = {Zachary Remscrim},
title = {The Power of a Single Qubit: Two-way Quantum/Classical Finite Automata
and the Word Problem for Linear Groups},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-107}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/107},
eprinttype = {ECCC},
eprint = {TR19-107},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Remscrim19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Remscrim19a,
author = {Zachary Remscrim},
title = {The Limitations of Few Qubits: One-way and Two-way Quantum Finite
Automata and the Group Word Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-182}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/182},
eprinttype = {ECCC},
eprint = {TR19-182},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Remscrim19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RezendeNRS19,
author = {Susanna F. de Rezende and
Jakob Nordstr{\"{o}}m and
Kilian Risse and
Dmitry Sokolov},
title = {Exponential Resolution Lower Bounds for Weak Pigeonhole Principle
and Perfect Matching Formulas over Sparse Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-174}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/174},
eprinttype = {ECCC},
eprint = {TR19-174},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RezendeNRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RichelsonR19,
author = {Silas Richelson and
Sourya Roy},
title = {Locally Testable Non-Malleable Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-117}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/117},
eprinttype = {ECCC},
eprint = {TR19-117},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RichelsonR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ron-ZewiR19,
author = {Noga Ron{-}Zewi and
Ron Rothblum},
title = {Local Proofs Approaching the Witness Length},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-127}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/127},
eprinttype = {ECCC},
eprint = {TR19-127},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ron-ZewiR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Santhanam19,
author = {Rahul Santhanam},
title = {Pseudorandomness and the Minimum Circuit Size Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-155}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/155},
eprinttype = {ECCC},
eprint = {TR19-155},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Santhanam19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ShaltielKS19,
author = {Ronen Shaltiel and
Swastik Kopparty and
Jad Silbak},
title = {Quasilinear time list-decodable codes for space bounded channels},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-090}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/090},
eprinttype = {ECCC},
eprint = {TR19-090},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ShaltielKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Sherstov19,
author = {Alexander A. Sherstov},
title = {The hardest halfspace},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-016}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/016},
eprinttype = {ECCC},
eprint = {TR19-016},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Sherstov19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SherstovT19,
author = {Alexander A. Sherstov and
Justin Thaler},
title = {Vanishing-Error Approximate Degree and {QMA} Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-121}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/121},
eprinttype = {ECCC},
eprint = {TR19-121},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SherstovT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SherstovW19,
author = {Alexander A. Sherstov and
Pei Wu},
title = {Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of
{AC0}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-003}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/003},
eprinttype = {ECCC},
eprint = {TR19-003},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SherstovW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Srinivasan19,
author = {Srikanth Srinivasan},
title = {Strongly Exponential Separation Between Monotone {VP} and Monotone
{VNP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-032}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/032},
eprinttype = {ECCC},
eprint = {TR19-032},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Srinivasan19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SrinivasanTV19,
author = {Srikanth Srinivasan and
Utkarsh Tripathi and
S. Venkitesh},
title = {Decoding Downset codes over a finite grid},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-109}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/109},
eprinttype = {ECCC},
eprint = {TR19-109},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SrinivasanTV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SrinivasanTV19a,
author = {Srikanth Srinivasan and
Utkarsh Tripathi and
S. Venkitesh},
title = {On the Probabilistic Degrees of Symmetric Boolean functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-138}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/138},
eprinttype = {ECCC},
eprint = {TR19-138},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SrinivasanTV19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Stephens-Davidowitz19,
author = {Noah Stephens{-}Davidowitz and
Vinod Vaikuntanathan},
title = {SETH-hardness of Coding Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-159}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/159},
eprinttype = {ECCC},
eprint = {TR19-159},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Stephens-Davidowitz19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Tal19,
author = {Avishay Tal},
title = {Towards Optimal Separations between Quantum and Randomized Query Complexities},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-179}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/179},
eprinttype = {ECCC},
eprint = {TR19-179},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Tal19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ToranW19,
author = {Jacobo Tor{\'{a}}n and
Florian W{\"{o}}rz},
title = {Reversible Pebble Games and the Relation Between Tree-Like and General
Resolution Space},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-097}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/097},
eprinttype = {ECCC},
eprint = {TR19-097},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ToranW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/TyagiW19,
author = {Himanshu Tyagi and
Shun Watanabe},
title = {A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-014}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/014},
eprinttype = {ECCC},
eprint = {TR19-014},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/TyagiW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/VinkhuijzenD19,
author = {Lieuwe Vinkhuijzen and
Andr{\'{e}} H. Deutz},
title = {A Simple Proof of Vyalyi's Theorem and some Generalizations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-131}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/131},
eprinttype = {ECCC},
eprint = {TR19-131},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/VinkhuijzenD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Viola19,
author = {Emanuele Viola},
title = {Pseudorandom bits and lower bounds for randomized Turing machines},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-051}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/051},
eprinttype = {ECCC},
eprint = {TR19-051},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Viola19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Viola19a,
author = {Emanuele Viola},
title = {Matching Smolensky's correlation bound with majority},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-175}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/175},
eprinttype = {ECCC},
eprint = {TR19-175},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Viola19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Watson19,
author = {Thomas Watson},
title = {A Lower Bound for Sampling Disjoint Sets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-066}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/066},
eprinttype = {ECCC},
eprint = {TR19-066},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Watson19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/WattsKST19,
author = {Adam Bene Watts and
Robin Kothari and
Luke Schaeffer and
Avishay Tal},
title = {Exponential separation between shallow quantum circuits and unbounded
fan-in shallow classical circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-089}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/089},
eprinttype = {ECCC},
eprint = {TR19-089},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/WattsKST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/XingY19,
author = {Chaoping Xing and
Chen Yuan},
title = {Beating the probabilistic lower bound on perfect hashing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-108}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/108},
eprinttype = {ECCC},
eprint = {TR19-108},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/XingY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Zak19,
author = {Stanislav Z{\'{a}}k},
title = {A Logical Characteristic of Read-Once Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-150}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/150},
eprinttype = {ECCC},
eprint = {TR19-150},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Zak19.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 18:37 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:
