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/eccc20.bht:"
download as .bib file
@article{DBLP:journals/eccc/Aaronson13,
author = {Scott Aaronson},
title = {BosonSampling Is Far From Uniform},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-135}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/135},
eprinttype = {ECCC},
eprint = {TR13-135},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Aaronson13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AaronsonABB13,
author = {Scott Aaronson and
Andris Ambainis and
Kaspars Balodis and
Mohammad Bavarian},
title = {Weak Parity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-164}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/164},
eprinttype = {ECCC},
eprint = {TR13-164},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AaronsonABB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AbasiB13,
author = {Hasan Abasi and
Nader H. Bshouty},
title = {A Simple Algorithm for Undirected Hamiltonicity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-012}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/012},
eprinttype = {ECCC},
eprint = {TR13-012},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AbasiB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AfshaniMW13,
author = {Peyman Afshani and
Kevin Matulef and
Bryan T. Wilkinson},
title = {Property Testing on Linked Lists},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-187}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/187},
eprinttype = {ECCC},
eprint = {TR13-187},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AfshaniMW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AggarwalD13,
author = {Divesh Aggarwal and
Chandan K. Dubey},
title = {Improved hardness results for unique shortest vector problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-076}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/076},
eprinttype = {ECCC},
eprint = {TR13-076},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AggarwalD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AggarwalDL13,
author = {Divesh Aggarwal and
Yevgeniy Dodis and
Shachar Lovett},
title = {Non-malleable Codes from Additive Combinatorics},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-081}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/081},
eprinttype = {ECCC},
eprint = {TR13-081},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AggarwalDL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalGKS13,
author = {Manindra Agrawal and
Rohit Gurjar and
Arpita Korwar and
Nitin Saxena},
title = {Hitting-sets for low-distance multilinear depth-3},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-174}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/174},
eprinttype = {ECCC},
eprint = {TR13-174},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalGKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ajtai13,
author = {Mikl{\'{o}}s Ajtai},
title = {Lower Bounds for RAMs and Quantifier Elimination},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-083}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/083},
eprinttype = {ECCC},
eprint = {TR13-083},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ajtai13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AllenderBD13,
author = {Eric Allender and
Nikhil Balaji and
Samir Datta},
title = {Low-depth Uniform Threshold Circuits and the Bit-Complexity of Straight
Line Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-177}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/177},
eprinttype = {ECCC},
eprint = {TR13-177},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AllenderBD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AponKM13,
author = {Daniel Apon and
Jonathan Katz and
Alex J. Malozemoff},
title = {One-Round Multi-Party Communication Complexity of Distinguishing Sums},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-013}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/013},
eprinttype = {ECCC},
eprint = {TR13-013},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AponKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ApplebaumM13,
author = {Benny Applebaum and
Yoni Moses},
title = {Locally Computable {UOWHF} with Linear Shrinkage},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-098}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/098},
eprinttype = {ECCC},
eprint = {TR13-098},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ApplebaumM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AtseriasMO13,
author = {Albert Atserias and
Moritz M{\"{u}}ller and
Sergi Oliva},
title = {Lower Bounds for DNF-Refutations of a Relativized Weak Pigeonhole
Principle},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-116}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/116},
eprinttype = {ECCC},
eprint = {TR13-116},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AtseriasMO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AtseriasT13,
author = {Albert Atserias and
Neil Thapen},
title = {The Ordering Principle in a Fragment of Approximate Counting},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-149}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/149},
eprinttype = {ECCC},
eprint = {TR13-149},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AtseriasT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AustrinGH13,
author = {Per Austrin and
Venkatesan Guruswami and
Johan H{\aa}stad},
title = {(2+{\(\epsilon\)})-SAT is NP-hard},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-159}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/159},
eprinttype = {ECCC},
eprint = {TR13-159},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AustrinGH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BackursB13,
author = {Arturs Backurs and
Mohammad Bavarian},
title = {On the sum of {L1} influences},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-039}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/039},
eprinttype = {ECCC},
eprint = {TR13-039},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BackursB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BalajiD13,
author = {Nikhil Balaji and
Samir Datta},
title = {Collapsing Exact Arithmetic Hierarchies},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-131}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/131},
eprinttype = {ECCC},
eprint = {TR13-131},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BalajiD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Barak13,
author = {Boaz Barak},
title = {Structure vs Combinatorics in Computational Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-182}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/182},
eprinttype = {ECCC},
eprint = {TR13-182},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Barak13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakKS13,
author = {Boaz Barak and
Jonathan A. Kelner and
David Steurer},
title = {Rounding Sum-of-Squares Relaxations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-184}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/184},
eprinttype = {ECCC},
eprint = {TR13-184},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BarakKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BauwensMVZ13,
author = {Bruno Bauwens and
Anton Makhlin and
Nikolay K. Vereshchagin and
Marius Zimand},
title = {Short lists with short programs in short time},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-007}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/007},
eprinttype = {ECCC},
eprint = {TR13-007},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BauwensMVZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BazziN13,
author = {Louay Bazzi and
Nagi Nahas},
title = {Small-bias is not enough to hit read-once {CNF}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-034}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/034},
eprinttype = {ECCC},
eprint = {TR13-034},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BazziN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeameCM13,
author = {Paul Beame and
Rapha{\"{e}}l Clifford and
Widad Machmouchi},
title = {Element Distinctness, Frequency Moments, and Sliding Windows},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-127}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/127},
eprinttype = {ECCC},
eprint = {TR13-127},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeameCM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-SassonKKMS13,
author = {Eli Ben{-}Sasson and
Yohay Kaplan and
Swastik Kopparty and
Or Meir and
Henning Stichtenoth},
title = {Constant rate PCPs for circuit-SAT with sublinear query complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-085}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/085},
eprinttype = {ECCC},
eprint = {TR13-085},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonKKMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BenjaminiCS13,
author = {Itai Benjamini and
Gil Cohen and
Igor Shinkar},
title = {Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-138}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/138},
eprinttype = {ECCC},
eprint = {TR13-138},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BenjaminiCS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Beyersdorff13,
author = {Olaf Beyersdorff},
title = {The Complexity of Theorem Proving in Autoepistemic Logic},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-016}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/016},
eprinttype = {ECCC},
eprint = {TR13-016},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Beyersdorff13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bhattacharyya13,
author = {Arnab Bhattacharyya},
title = {On testing affine-invariant properties},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-166}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/166},
eprinttype = {ECCC},
eprint = {TR13-166},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bhattacharyya13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bhrushundi13,
author = {Abhishek Bhrushundi},
title = {On testing bent functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-089}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/089},
eprinttype = {ECCC},
eprint = {TR13-089},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bhrushundi13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhrushundiCK13,
author = {Abhishek Bhrushundi and
Sourav Chakraborty and
Raghav Kulkarni},
title = {Property Testing Bounds for Linear and Quadratic Functions via Parity
Decision Trees},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-142}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/142},
eprinttype = {ECCC},
eprint = {TR13-142},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhrushundiCK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlaisRY13,
author = {Eric Blais and
Sofya Raskhodnikova and
Grigory Yaroslavtsev},
title = {Lower Bounds for Testing Properties of Functions on Hypergrid Domains},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-036}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/036},
eprinttype = {ECCC},
eprint = {TR13-036},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlaisRY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlaisT13,
author = {Eric Blais and
Li{-}Yang Tan},
title = {Approximating Boolean functions with depth-2 circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-051}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/051},
eprinttype = {ECCC},
eprint = {TR13-051},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlaisT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BoulandA13,
author = {Adam Bouland and
Scott Aaronson},
title = {Any Beamsplitter Generates Universal Quantum Linear Optics},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-147}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/147},
eprinttype = {ECCC},
eprint = {TR13-147},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BoulandA13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakerskiN13,
author = {Zvika Brakerski and
Moni Naor},
title = {Fast Algorithms for Interactive Coding},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-014}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/014},
eprinttype = {ECCC},
eprint = {TR13-014},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakerskiN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BraunJLP13,
author = {G{\'{a}}bor Braun and
Rahul Jain and
Troy Lee and
Sebastian Pokutta},
title = {Information-theoretic approximations of the nonnegative rank},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-158}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/158},
eprinttype = {ECCC},
eprint = {TR13-158},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BraunJLP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BraunP13,
author = {G{\'{a}}bor Braun and
Sebastian Pokutta},
title = {Common information and unique disjointness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-056}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/056},
eprinttype = {ECCC},
eprint = {TR13-056},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BraunP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanG13,
author = {Mark Braverman and
Ankit Garg},
title = {Public vs private coin in bounded-round information},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-130}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/130},
eprinttype = {ECCC},
eprint = {TR13-130},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanRWY13,
author = {Mark Braverman and
Anup Rao and
Omri Weinstein and
Amir Yehudayoff},
title = {Direct product via round-preserving compression},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-035}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/035},
eprinttype = {ECCC},
eprint = {TR13-035},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanRWY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty13,
author = {Nader H. Bshouty},
title = {Multilinear Complexity is Equivalent to Optimal Tester Size},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-011}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/011},
eprinttype = {ECCC},
eprint = {TR13-011},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BunT13,
author = {Mark Bun and
Justin Thaler},
title = {Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-032}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/032},
eprinttype = {ECCC},
eprint = {TR13-032},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BunT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BunT13a,
author = {Mark Bun and
Justin Thaler},
title = {Hardness Amplification and the Approximate Degree of Constant-Depth
Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-151}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/151},
eprinttype = {ECCC},
eprint = {TR13-151},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BunT13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CadilhacKM13,
author = {Micha{\"{e}}l Cadilhac and
Andreas Krebs and
Pierre McKenzie},
title = {The Algebraic Theory of Parikh Automata},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-040}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/040},
eprinttype = {ECCC},
eprint = {TR13-040},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CadilhacKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CaiG13,
author = {Jin{-}Yi Cai and
Aaron Gorenstein},
title = {Matchgates Revisited},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-048}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/048},
eprinttype = {ECCC},
eprint = {TR13-048},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CaiG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CamposSW13,
author = {Cassio P. de Campos and
Georgios Stamoulis and
Dennis Weyland},
title = {A Structured View on Weighted Counting with Relations to Quantum Computation
and Applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-133}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/133},
eprinttype = {ECCC},
eprint = {TR13-133},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CamposSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabartiCMTV13,
author = {Amit Chakrabarti and
Graham Cormode and
Andrew McGregor and
Justin Thaler and
Suresh Venkatasubramanian},
title = {On Interactivity in Arthur-Merlin Communication and Stream Computation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-180}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/180},
eprinttype = {ECCC},
eprint = {TR13-180},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabartiCMTV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabartyS13,
author = {Deeparnab Chakrabarty and
C. Seshadhri},
title = {A o(n) monotonicity tester for Boolean functions over the hypercube},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-029}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/029},
eprinttype = {ECCC},
eprint = {TR13-029},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabartyS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabartyS13a,
author = {Deeparnab Chakrabarty and
C. Seshadhri},
title = {An optimal lower bound for monotonicity testing over hypergrids},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-062}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/062},
eprinttype = {ECCC},
eprint = {TR13-062},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabartyS13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabortyKLS13,
author = {Sourav Chakraborty and
Raghav Kulkarni and
Satyanarayana V. Lokam and
Nitin Saurabh},
title = {Upper Bounds on Fourier Entropy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-052}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/052},
eprinttype = {ECCC},
eprint = {TR13-052},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabortyKLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Chan13,
author = {Siu Man Chan},
title = {Just a Pebble Game},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-042}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/042},
eprinttype = {ECCC},
eprint = {TR13-042},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Chan13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenF13,
author = {Yijia Chen and
J{\"{o}}rg Flum},
title = {On Limitations of the Ehrenfeucht-Fraisse-method in Descriptive Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-065}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/065},
eprinttype = {ECCC},
eprint = {TR13-065},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenKKSZ13,
author = {Ruiwen Chen and
Valentine Kabanets and
Antonina Kolokolova and
Ronen Shaltiel and
David Zuckerman},
title = {Mining Circuit Lower Bound Proofs for Meta-Algorithms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-057}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/057},
eprinttype = {ECCC},
eprint = {TR13-057},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenKKSZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenKS13,
author = {Ruiwen Chen and
Valentine Kabanets and
Nitin Saurabh},
title = {An Improved Deterministic {\#}SAT Algorithm for Small De Morgan Formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-150}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/150},
eprinttype = {ECCC},
eprint = {TR13-150},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CheraghchiG13,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami},
title = {Capacity of Non-Malleable Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-118}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/118},
eprinttype = {ECCC},
eprint = {TR13-118},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CheraghchiG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CheraghchiG13a,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami},
title = {Non-Malleable Coding Against Bit-wise and Split-State Tampering},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-121}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/121},
eprinttype = {ECCC},
eprint = {TR13-121},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CheraghchiG13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChlebikovaC13,
author = {Janka Chleb{\'{\i}}kov{\'{a}} and
Morgan Chopin},
title = {The Firefighter Problem: {A} Structural Analysis},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-162}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/162},
eprinttype = {ECCC},
eprint = {TR13-162},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChlebikovaC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CohenDIKMRR13,
author = {Gil Cohen and
Ivan Bjerre Damg{\aa}rd and
Yuval Ishai and
Jonas K{\"{o}}lker and
Peter Bro Miltersen and
Ran Raz and
Ron Rothblum},
title = {Efficient Multiparty Protocols via Log-Depth Threshold Formulae},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-107}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/107},
eprinttype = {ECCC},
eprint = {TR13-107},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CohenDIKMRR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CohenT13,
author = {Gil Cohen and
Avishay Tal},
title = {Two Structural Results for Low Degree Polynomials and Applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-145}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/145},
eprinttype = {ECCC},
eprint = {TR13-145},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CohenT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CohenT13a,
author = {Gil Cohen and
Amnon Ta{-}Shma},
title = {Pseudorandom Generators for Low Degree Polynomials from Algebraic
Geometry Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-155}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/155},
eprinttype = {ECCC},
eprint = {TR13-155},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CohenT13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DeDS13,
author = {Anindya De and
Ilias Diakonikolas and
Rocco A. Servedio},
title = {Deterministic Approximate Counting for Juntas of Degree-2 Polynomial
Threshold Functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-171}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/171},
eprinttype = {ECCC},
eprint = {TR13-171},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DeDS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DeDS13a,
author = {Anindya De and
Ilias Diakonikolas and
Rocco A. Servedio},
title = {Deterministic Approximate Counting for Degree-2 Polynomial Threshold
Functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-172}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/172},
eprinttype = {ECCC},
eprint = {TR13-172},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DeDS13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DeS13,
author = {Anindya De and
Rocco A. Servedio},
title = {Efficient deterministic approximate counting for low degree polynomial
threshold functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-173}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/173},
eprinttype = {ECCC},
eprint = {TR13-173},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DeS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurG13,
author = {Irit Dinur and
Elazar Goldenberg},
title = {Clustering in the Boolean Hypercube in a List Decoding Regime},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-031}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/031},
eprinttype = {ECCC},
eprint = {TR13-031},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DinurG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurG13a,
author = {Irit Dinur and
Venkatesan Guruswami},
title = {PCPs via low-degree long code and hardness for constrained hypergraph
coloring},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-122}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/122},
eprinttype = {ECCC},
eprint = {TR13-122},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DinurG13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurS13,
author = {Irit Dinur and
Igor Shinkar},
title = {On the Conditional Hardness of Coloring a 4-colorable Graph with Super-Constant
Number of Colors},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-148}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/148},
eprinttype = {ECCC},
eprint = {TR13-148},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DinurS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurS13a,
author = {Irit Dinur and
David Steurer},
title = {Direct Product Testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-179}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/179},
eprinttype = {ECCC},
eprint = {TR13-179},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DinurS13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DvirH13,
author = {Zeev Dvir and
Guangda Hu},
title = {Matching-Vector Families and LDCs Over Large Modulo},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-061}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/061},
eprinttype = {ECCC},
eprint = {TR13-061},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DvirH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DvirSW13,
author = {Zeev Dvir and
Shubhangi Saraf and
Avi Wigderson},
title = {Breaking the quadratic barrier for 3-LCCs over the Reals},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-160}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/160},
eprinttype = {ECCC},
eprint = {TR13-160},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DvirSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/EtessamiSY13,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
title = {A note on the complexity of comparing succinctly represented integers,
with an application to maximum probability parsing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-069}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/069},
eprinttype = {ECCC},
eprint = {TR13-069},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/EtessamiSY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FazeliLV13,
author = {Arman Fazeli and
Shachar Lovett and
Alexander Vardy},
title = {Nontrivial t-designs over finite fields exist for all t},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-126}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/126},
eprinttype = {ECCC},
eprint = {TR13-126},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FazeliLV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FeigeI13,
author = {Uriel Feige and
Rani Izsak},
title = {Welfare Maximization and the Supermodular Degree},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-095}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/095},
eprinttype = {ECCC},
eprint = {TR13-095},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FeigeI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FennerGKT13,
author = {Stephen A. Fenner and
Rohit Gurjar and
Arpita Korwar and
Thomas Thierauf},
title = {On Two-Level Poset Games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-019}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/019},
eprinttype = {ECCC},
eprint = {TR13-019},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FennerGKT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FilmusPRC13,
author = {Yuval Filmus and
Toniann Pitassi and
Robert Robere and
Stephen A. Cook},
title = {Average Case Lower Bounds for Monotone Switching Networks},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-054}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/054},
eprinttype = {ECCC},
eprint = {TR13-054},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FilmusPRC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FischerGL13,
author = {Eldar Fischer and
Yonatan Goldhirsh and
Oded Lachish},
title = {Some properties are not even partially testable},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-082}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/082},
eprinttype = {ECCC},
eprint = {TR13-082},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FischerGL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FloderusLPS13,
author = {Peter Floderus and
Andrzej Lingas and
Mia Persson and
Dzmitry Sledneu},
title = {Detecting Monomials with k Distinct Variables},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-139}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/139},
eprinttype = {ECCC},
eprint = {TR13-139},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FloderusLPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ForbesS13,
author = {Michael A. Forbes and
Amir Shpilka},
title = {Explicit Noether Normalization for Simultaneous Conjugation via Polynomial
Identity Testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-033}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/033},
eprinttype = {ECCC},
eprint = {TR13-033},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ForbesS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ForbesSS13,
author = {Michael A. Forbes and
Ramprasad Saptharishi and
Amir Shpilka},
title = {Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs,
in any Order},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-132}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/132},
eprinttype = {ECCC},
eprint = {TR13-132},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ForbesSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FournierLMS13,
author = {Herv{\'{e}} Fournier and
Nutan Limaye and
Guillaume Malod and
Srikanth Srinivasan},
title = {Lower bounds for depth 4 formulas computing iterated matrix multiplication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-100}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/100},
eprinttype = {ECCC},
eprint = {TR13-100},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FournierLMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Friedman13,
author = {Luke Friedman},
title = {A Framework for Proving Proof Complexity Lower Bounds on Random CNFs
Using Encoding Techniques},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-027}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/027},
eprinttype = {ECCC},
eprint = {TR13-027},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Friedman13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FriedmanX13,
author = {Luke Friedman and
Yixin Xu},
title = {Exponential Lower Bounds for Refuting Random Formulas Using Ordered
Binary Decision Diagrams},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-018}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/018},
eprinttype = {ECCC},
eprint = {TR13-018},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FriedmanX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Fu13,
author = {Bin Fu},
title = {Derandomizing Polynomial Identity over Finite Fields Implies Super-Polynomial
Circuit Lower Bounds for {NEXP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-157}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/157},
eprinttype = {ECCC},
eprint = {TR13-157},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Fu13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GalJ13,
author = {Anna G{\'{a}}l and
Jing{-}Tang Jang},
title = {A Generalization of Spira's Theorem and Circuits with Small Segregators
or Separators},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-093}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/093},
eprinttype = {ECCC},
eprint = {TR13-093},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GalJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GamarnikS13,
author = {David Gamarnik and
Madhu Sudan},
title = {Limits of local algorithms over sparse random graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-055}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/055},
eprinttype = {ECCC},
eprint = {TR13-055},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GamarnikS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GanorR13,
author = {Anat Ganor and
Ran Raz},
title = {Space Pseudorandom Generators by Communication Complexity Lower Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-064}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/064},
eprinttype = {ECCC},
eprint = {TR13-064},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GanorR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GavinskyIW13,
author = {Dmitry Gavinsky and
Tsuyoshi Ito and
Guoming Wang},
title = {Shared Randomness and Quantum Communication in the Multi-Party Model},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-044}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/044},
eprinttype = {ECCC},
eprint = {TR13-044},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GavinskyIW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GavinskyL13,
author = {Dmitry Gavinsky and
Shachar Lovett},
title = {En Route to the log-rank Conjecture: New Reductions and Equivalent
Formulations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-080}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/080},
eprinttype = {ECCC},
eprint = {TR13-080},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GavinskyL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GavinskyMWW13,
author = {Dmitry Gavinsky and
Or Meir and
Omri Weinstein and
Avi Wigderson},
title = {Toward Better Formula Lower Bounds: An Information Complexity Approach
to the {KRW} Composition Conjecture},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-190}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/190},
eprinttype = {ECCC},
eprint = {TR13-190},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GavinskyMWW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GishbolinerS13,
author = {Lior Gishboliner and
Asaf Shapira},
title = {Deterministic vs Non-deterministic Graph Property Testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-059}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/059},
eprinttype = {ECCC},
eprint = {TR13-059},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GishbolinerS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GlasserNRSW13,
author = {Christian Gla{\ss}er and
Dung T. Nguyen and
Christian Reitwie{\ss}ner and
Alan L. Selman and
Maximilian Witek},
title = {Autoreducibility of Complete Sets for Log-Space and Polynomial-Time
Reductions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-047}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/047},
eprinttype = {ECCC},
eprint = {TR13-047},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GlasserNRSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GlasserW13,
author = {Christian Gla{\ss}er and
Maximilian Witek},
title = {Autoreducibility and Mitoticity of Logspace-Complete Sets for {NP}
and Other Classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-188}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/188},
eprinttype = {ECCC},
eprint = {TR13-188},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GlasserW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoldbergR13,
author = {Paul W. Goldberg and
Aaron Roth},
title = {Bounds for the Query Complexity of Approximate Equilibria},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-136}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/136},
eprinttype = {ECCC},
eprint = {TR13-136},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoldbergR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Goldreich13,
author = {Oded Goldreich},
title = {On Multiple Input Problems in Property Testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-067}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/067},
eprinttype = {ECCC},
eprint = {TR13-067},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Goldreich13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Goldreich13a,
author = {Oded Goldreich},
title = {On the Communication Complexity Methodology for Proving Lower Bounds
on the Query Complexity of Property Testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-073}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/073},
eprinttype = {ECCC},
eprint = {TR13-073},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Goldreich13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoldreichR13,
author = {Oded Goldreich and
Dana Ron},
title = {On Sample-Based Testers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-109}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/109},
eprinttype = {ECCC},
eprint = {TR13-109},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoldreichR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoldreichW13,
author = {Oded Goldreich and
Avi Wigderson},
title = {On the Size of Depth-Three Boolean Circuits for Computing Multilinear
Functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-043}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/043},
eprinttype = {ECCC},
eprint = {TR13-043},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoldreichW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GoldreichW13a,
author = {Oded Goldreich and
Avi Wigderson},
title = {On Derandomizing Algorithms that Err Extremely Rarely},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-152}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/152},
eprinttype = {ECCC},
eprint = {TR13-152},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GoldreichW13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanHJY13,
author = {Parikshit Gopalan and
Cheng Huang and
Bob Jenkins and
Sergey Yekhanin},
title = {Explicit Maximally Recoverable Codes with Locality},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-104}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/104},
eprinttype = {ECCC},
eprint = {TR13-104},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanHJY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanVZ13,
author = {Parikshit Gopalan and
Salil P. Vadhan and
Yuan Zhou},
title = {Locally Testable Codes and Cayley Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-114}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/114},
eprinttype = {ECCC},
eprint = {TR13-114},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanVZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GrigorescuWX13,
author = {Elena Grigorescu and
Karl Wimmer and
Ning Xie},
title = {Tight Lower Bounds for Testing Linear Isomorphism},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-090}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/090},
eprinttype = {ECCC},
eprint = {TR13-090},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GrigorescuWX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GrochowQ13,
author = {Joshua A. Grochow and
Youming Qiao},
title = {Algorithms for group isomorphism via group extensions and cohomology},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-123}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/123},
eprinttype = {ECCC},
eprint = {TR13-123},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GrochowQ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Guo13,
author = {Alan Guo},
title = {High rate locally correctable codes via lifting},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-053}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/053},
eprinttype = {ECCC},
eprint = {TR13-053},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Guo13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Guo13a,
author = {Zeyu Guo},
title = {Randomness-efficient Curve Samplers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-120}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/120},
eprinttype = {ECCC},
eprint = {TR13-120},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Guo13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuptaKKS13,
author = {Ankit Gupta and
Pritish Kamath and
Neeraj Kayal and
Ramprasad Saptharishi},
title = {Arithmetic circuits: {A} chasm at depth three},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-026}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/026},
eprinttype = {ECCC},
eprint = {TR13-026},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuptaKKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GurR13,
author = {Tom Gur and
Ran Raz},
title = {Arthur-Merlin Streaming Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-020}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/020},
eprinttype = {ECCC},
eprint = {TR13-020},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GurR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GurR13a,
author = {Tom Gur and
Ron Rothblum},
title = {Non-Interactive Proofs of Proximity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-078}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/078},
eprinttype = {ECCC},
eprint = {TR13-078},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GurR13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GurjarKMT13,
author = {Rohit Gurjar and
Arpita Korwar and
Jochen Messner and
Thomas Thierauf},
title = {Exact Perfect Matching in Complete Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-112}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/112},
eprinttype = {ECCC},
eprint = {TR13-112},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GurjarKMT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiHHSV13,
author = {Venkatesan Guruswami and
Prahladh Harsha and
Johan H{\aa}stad and
Srikanth Srinivasan and
Girish Varma},
title = {Super-polylogarithmic hypergraph coloring hardness via low-degree
long codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-167}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/167},
eprinttype = {ECCC},
eprint = {TR13-167},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiHHSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiK13,
author = {Venkatesan Guruswami and
Swastik Kopparty},
title = {Explicit Subspace Designs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-060}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/060},
eprinttype = {ECCC},
eprint = {TR13-060},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiL13,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Complexity of approximating {CSP} with Balance / Hard Constraints},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-125}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/125},
eprinttype = {ECCC},
eprint = {TR13-125},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiO13,
author = {Venkatesan Guruswami and
Krzysztof Onak},
title = {Superlinear lower bounds for multipass graph processing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-002}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/002},
eprinttype = {ECCC},
eprint = {TR13-002},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiSS13,
author = {Venkatesan Guruswami and
Sushant Sachdeva and
Rishi Saket},
title = {Inapproximability of Minimum Vertex Cover on k-uniform k-partite Hypergraphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-071}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/071},
eprinttype = {ECCC},
eprint = {TR13-071},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiW13,
author = {Venkatesan Guruswami and
Carol Wang},
title = {Explicit rank-metric codes list-decodable with optimal redundancy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-170}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/170},
eprinttype = {ECCC},
eprint = {TR13-170},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiX13,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Optimal rate list decoding of folded algebraic-geometric codes over
constant-sized alphabets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-046}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/046},
eprinttype = {ECCC},
eprint = {TR13-046},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiX13a,
author = {Venkatesan Guruswami and
Patrick Xia},
title = {Polar Codes: Speed of polarization and polynomial gap to capacity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-050}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/050},
eprinttype = {ECCC},
eprint = {TR13-050},
timestamp = {Thu, 23 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiX13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiX13b,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Hitting Sets for Low-Degree Polynomials with Optimal Density},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-175}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/175},
eprinttype = {ECCC},
eprint = {TR13-175},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiX13b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Gurvits13,
author = {Leonid Gurvits},
title = {Boolean matrices with prescribed row/column sums and stable homogeneous
polynomials: combinatorial and algorithmic applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-141}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/141},
eprinttype = {ECCC},
eprint = {TR13-141},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Gurvits13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HansenP13,
author = {Kristoffer Arnsfelt Hansen and
Vladimir V. Podolskii},
title = {Polynomial threshold functions and Boolean threshold circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-021}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/021},
eprinttype = {ECCC},
eprint = {TR13-021},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HansenP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HaramatyRS13,
author = {Elad Haramaty and
Noga Ron{-}Zewi and
Madhu Sudan},
title = {Absolutely Sound Testing of Lifted Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-030}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/030},
eprinttype = {ECCC},
eprint = {TR13-030},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HaramatyRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HatamiL13,
author = {Hamed Hatami and
Shachar Lovett},
title = {Estimating the distance from testable affine-invariant properties},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-087}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/087},
eprinttype = {ECCC},
eprint = {TR13-087},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HatamiL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Hrubes13,
author = {Pavel Hrubes},
title = {A note on semantic cutting planes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-128}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/128},
eprinttype = {ECCC},
eprint = {TR13-128},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Hrubes13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ImpagliazzoK13,
author = {Russell Impagliazzo and
Valentine Kabanets},
title = {Fourier Concentration from Shrinkage},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-163}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/163},
eprinttype = {ECCC},
eprint = {TR13-163},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/IshaiKLOPSZ13,
author = {Yuval Ishai and
Eyal Kushilevitz and
Xin Li and
Rafail Ostrovsky and
Manoj Prabhakaran and
Amit Sahai and
David Zuckerman},
title = {Robust Pseudorandom Generators},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-143}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/143},
eprinttype = {ECCC},
eprint = {TR13-143},
timestamp = {Wed, 17 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/IshaiKLOPSZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/IvanyosKQS13,
author = {G{\'{a}}bor Ivanyos and
Marek Karpinski and
Youming Qiao and
Miklos Santha},
title = {Generalized Wong sequences and their applications to Edmonds' problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-103}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/103},
eprinttype = {ECCC},
eprint = {TR13-103},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/IvanyosKQS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/JafargholiV13,
author = {Zahra Jafargholi and
Emanuele Viola},
title = {3SUM, 3XOR, Triangles},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-009}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/009},
eprinttype = {ECCC},
eprint = {TR13-009},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/JafargholiV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/JahanjouMV13,
author = {Hamidreza Jahanjou and
Eric Miles and
Emanuele Viola},
title = {Local reductions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-099}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/099},
eprinttype = {ECCC},
eprint = {TR13-099},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/JahanjouMV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/JanotaM13,
author = {Mikol{\'{a}}s Janota and
Jo{\~{a}}o Marques{-}Silva},
title = {On Propositional {QBF} Expansions and Q-Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-097}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/097},
eprinttype = {ECCC},
eprint = {TR13-097},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/JanotaM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Johannsen13,
author = {Jan Johannsen},
title = {Exponential Separations in a Hierarchy of Clause Learning Proof Systems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-072}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/072},
eprinttype = {ECCC},
eprint = {TR13-072},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Johannsen13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Juba13,
author = {Brendan Juba},
title = {On Non-automatizability in PAC-Semantics},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-094}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/094},
eprinttype = {ECCC},
eprint = {TR13-094},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Juba13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KabanetsK13,
author = {Valentine Kabanets and
Antonina Kolokolova},
title = {Compression of Boolean Functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-024}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/024},
eprinttype = {ECCC},
eprint = {TR13-024},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KabanetsK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KalaiRR13,
author = {Yael Tauman Kalai and
Ran Raz and
Ron Rothblum},
title = {How to Delegate Computations: The Power of No-Signaling Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-183}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/183},
eprinttype = {ECCC},
eprint = {TR13-183},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KalaiRR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KaneW13,
author = {Daniel M. Kane and
Osamu Watanabe},
title = {A Short Implicant of CNFs with Relatively Many Satisfying Assignments},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-176}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/176},
eprinttype = {ECCC},
eprint = {TR13-176},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KaneW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KarpinskiLS13,
author = {Marek Karpinski and
Michael Lampis and
Richard Schmied},
title = {New Inapproximability Bounds for {TSP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-045}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/045},
eprinttype = {ECCC},
eprint = {TR13-045},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KarpinskiLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KarpinskiS13,
author = {Marek Karpinski and
Richard Schmied},
title = {Approximation Hardness of Graphic {TSP} on Cubic Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-066}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/066},
eprinttype = {ECCC},
eprint = {TR13-066},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KarpinskiS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KayalSS13,
author = {Neeraj Kayal and
Chandan Saha and
Ramprasad Saptharishi},
title = {A super-polynomial lower bound for regular arithmetic formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-091}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/091},
eprinttype = {ECCC},
eprint = {TR13-091},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KayalSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KerenidisLX13,
author = {Iordanis Kerenidis and
Mathieu Lauri{\`{e}}re and
David Xiao},
title = {New lower bounds for privacy in communication protocols},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-015}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/015},
eprinttype = {ECCC},
eprint = {TR13-015},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KerenidisLX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KhotTW13,
author = {Subhash Khot and
Madhur Tulsiani and
Pratik Worah},
title = {A Characterization of Strong Approximation Resistance},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-075}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/075},
eprinttype = {ECCC},
eprint = {TR13-075},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KhotTW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KhotTW13a,
author = {Subhash Khot and
Madhur Tulsiani and
Pratik Worah},
title = {A Characterization of Approximation Resistance},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-146}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/146},
eprinttype = {ECCC},
eprint = {TR13-146},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KhotTW13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KlivansKO13,
author = {Adam R. Klivans and
Pravesh Kothari and
Igor C. Oliveira},
title = {Constructing Hard Functions from Learning Algorithms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-129}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/129},
eprinttype = {ECCC},
eprint = {TR13-129},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KlivansKO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KlivansM13,
author = {Adam R. Klivans and
Raghu Meka},
title = {Moment-Matching Polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-008}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/008},
eprinttype = {ECCC},
eprint = {TR13-008},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KlivansM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Knop13,
author = {Alexander Knop},
title = {Circuit Lower Bounds for Heuristic {MA}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-037}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/037},
eprinttype = {ECCC},
eprint = {TR13-037},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Knop13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KoblerKV13,
author = {Johannes K{\"{o}}bler and
Sebastian Kuhnert and
Oleg Verbitsky},
title = {Helly Circular-Arc Graph Isomorphism is in Logspace},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-074}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/074},
eprinttype = {ECCC},
eprint = {TR13-074},
timestamp = {Thu, 13 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KoblerKV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KolMSY13,
author = {Gillat Kol and
Shay Moran and
Amir Shpilka and
Amir Yehudayoff},
title = {Direct Sum Fails for Zero Error Average Communication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-079}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/079},
eprinttype = {ECCC},
eprint = {TR13-079},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KolMSY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KolR13,
author = {Gillat Kol and
Ran Raz},
title = {Interactive Channel Capacity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-001}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/001},
eprinttype = {ECCC},
eprint = {TR13-001},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KolR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KomarathS13,
author = {Balagopal Komarath and
Jayalal Sarma},
title = {Pebbling, Entropy and Branching Program Size Lower Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-006}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/006},
eprinttype = {ECCC},
eprint = {TR13-006},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KomarathS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KomargodskiRT13,
author = {Ilan Komargodski and
Ran Raz and
Avishay Tal},
title = {Improved Average-Case Lower Bounds for DeMorgan Formula Size},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-058}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/058},
eprinttype = {ECCC},
eprint = {TR13-058},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KomargodskiRT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Krajicek13,
author = {Jan Kraj{\'{\i}}cek},
title = {A reduction of proof complexity to computational complexity for AC\({}^{\mbox{0}}\)[p]
Frege systems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-156}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/156},
eprinttype = {ECCC},
eprint = {TR13-156},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Krajicek13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KrebsLMS13,
author = {Andreas Krebs and
Nutan Limaye and
Meena Mahajan and
Karteek Sreenivasaiah},
title = {Small Depth Proof Systems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-102}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/102},
eprinttype = {ECCC},
eprint = {TR13-102},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KrebsLMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KulkarniT13,
author = {Raghav Kulkarni and
Avishay Tal},
title = {On Fractional Block Sensitivity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-168}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/168},
eprinttype = {ECCC},
eprint = {TR13-168},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KulkarniT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarMN13,
author = {Mrinal Kumar and
Gaurav Maheshwari and
Jayalal Sarma},
title = {Arithmetic Circuit Lower Bounds via MaxRank},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-028}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/028},
eprinttype = {ECCC},
eprint = {TR13-028},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarMN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarS13,
author = {Mrinal Kumar and
Shubhangi Saraf},
title = {Lower Bounds for Depth 4 Homogenous Circuits with Bounded Top Fanin},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-068}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/068},
eprinttype = {ECCC},
eprint = {TR13-068},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarS13a,
author = {Mrinal Kumar and
Shubhangi Saraf},
title = {The Limits of Depth Reduction for Arithmetic Formulas: It's all about
the top fan-in},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-153}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/153},
eprinttype = {ECCC},
eprint = {TR13-153},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarS13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarS13b,
author = {Mrinal Kumar and
Shubhangi Saraf},
title = {Superpolynomial lower bounds for general homogeneous depth 4 arithmetic
circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-181}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/181},
eprinttype = {ECCC},
eprint = {TR13-181},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarS13b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LauriaPRT13,
author = {Massimo Lauria and
Pavel Pudl{\'{a}}k and
Vojtech R{\"{o}}dl and
Neil Thapen},
title = {The complexity of proving that a graph is Ramsey},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-038}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/038},
eprinttype = {ECCC},
eprint = {TR13-038},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LauriaPRT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Li13,
author = {Xin Li},
title = {Extractors for a Constant Number of Independent Sources with Polylogarithmic
Min-Entropy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-025}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/025},
eprinttype = {ECCC},
eprint = {TR13-025},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Li13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LiT13,
author = {Fu Li and
Iddo Tzameret},
title = {Generating Matrix Identities and Proof Complexity Lower Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-185}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/185},
eprinttype = {ECCC},
eprint = {TR13-185},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LiT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LiuZ13,
author = {Yang Liu and
Shengyu Zhang},
title = {Quantum and randomized communication complexity of {XOR} functions
in the {SMP} model},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-010}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/010},
eprinttype = {ECCC},
eprint = {TR13-010},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LiuZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Lovett13,
author = {Shachar Lovett},
title = {Communication is bounded by root of rank},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-084}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/084},
eprinttype = {ECCC},
eprint = {TR13-084},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Lovett13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Lutz13,
author = {Jack H. Lutz},
title = {The Frequent Paucity of Trivial Strings},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-161}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/161},
eprinttype = {ECCC},
eprint = {TR13-161},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Lutz13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MahmoodyMP13,
author = {Mohammad Mahmoody and
Hemanta K. Maji and
Manoj Prabhakaran},
title = {On the Power of Public-key Encryption in Secure Computation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-137}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/137},
eprinttype = {ECCC},
eprint = {TR13-137},
timestamp = {Wed, 17 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MahmoodyMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Meir13,
author = {Or Meir},
title = {Combinatorial PCPs with Short Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-134}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/134},
eprinttype = {ECCC},
eprint = {TR13-134},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Meir13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MekaW13,
author = {Raghu Meka and
Avi Wigderson},
title = {Association schemes, non-commutative polynomial concentration, and
sum-of-squares lower bounds for planted clique},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-105}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/105},
eprinttype = {ECCC},
eprint = {TR13-105},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MekaW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Micciancio13,
author = {Daniele Micciancio},
title = {Locally Dense Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-115}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/115},
eprinttype = {ECCC},
eprint = {TR13-115},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Micciancio13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MilesV13,
author = {Eric Miles and
Emanuele Viola},
title = {Shielding circuits with groups},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-003}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/003},
eprinttype = {ECCC},
eprint = {TR13-003},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MilesV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MoranY13,
author = {Shay Moran and
Amir Yehudayoff},
title = {A note on average-case sorting},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-106}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/106},
eprinttype = {ECCC},
eprint = {TR13-106},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MoranY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MullerS13,
author = {Moritz M{\"{u}}ller and
Stefan Szeider},
title = {Revisiting Space in Proof Complexity: Treewidth and Pathwidth},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-113}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/113},
eprinttype = {ECCC},
eprint = {TR13-113},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MullerS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/NguyenS13,
author = {Dung T. Nguyen and
Alan L. Selman},
title = {Non-autoreducible Sets for {NEXP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-063}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/063},
eprinttype = {ECCC},
eprint = {TR13-063},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/NguyenS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Oliveira13,
author = {Igor C. Oliveira},
title = {Algorithms versus Circuit Lower Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-117}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/117},
eprinttype = {ECCC},
eprint = {TR13-117},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Oliveira13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PapakonstantinouSS13,
author = {Periklis A. Papakonstantinou and
Dominik Scheder and
Hao Song},
title = {Overlays and Limited Memory Communication Mode(l)s},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-189}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/189},
eprinttype = {ECCC},
eprint = {TR13-189},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PapakonstantinouSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Pich13,
author = {J{\'{a}}n Pich},
title = {Circuit Lower Bounds in Bounded Arithmetics},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-077}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/077},
eprinttype = {ECCC},
eprint = {TR13-077},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Pich13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PudlakBT13,
author = {Pavel Pudl{\'{a}}k and
Arnold Beckmann and
Neil Thapen},
title = {Parity Games and Propositional Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-092}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/092},
eprinttype = {ECCC},
eprint = {TR13-092},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PudlakBT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ReingoldSV13,
author = {Omer Reingold and
Thomas Steinke and
Salil P. Vadhan},
title = {Pseudorandomness for Regular Branching Programs via Fourier Analysis},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-086}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/086},
eprinttype = {ECCC},
eprint = {TR13-086},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ReingoldSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RemscrimS13,
author = {Zachary Remscrim and
Michael Sipser},
title = {AC\({}^{\mbox{0}}\) Pseudorandomness of Natural Operations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-088}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/088},
eprinttype = {ECCC},
eprint = {TR13-088},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RemscrimS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RonS13,
author = {Dana Ron and
Rocco A. Servedio},
title = {Exponentially improved algorithms and lower bounds for testing signed
majorities},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-096}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/096},
eprinttype = {ECCC},
eprint = {TR13-096},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RonS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Rossman13,
author = {Benjamin Rossman},
title = {Formulas vs. Circuits for Small Distance Connectivity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-169}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/169},
eprinttype = {ECCC},
eprint = {TR13-169},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Rossman13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RudraW13,
author = {Atri Rudra and
Mary Wootters},
title = {Every list-decodable code for high noise has abundant near-optimal
rate puncturings},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-140}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/140},
eprinttype = {ECCC},
eprint = {TR13-140},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RudraW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SanthanamW13,
author = {Rahul Santhanam and
Ryan Williams},
title = {New Algorithms for {QBF} Satisfiability and Implications for Circuit
Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-108}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/108},
eprinttype = {ECCC},
eprint = {TR13-108},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SanthanamW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Savicky13,
author = {Petr Savick{\'{y}}},
title = {Boolean functions with a vertex-transitive group of automorphisms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-191}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/191},
eprinttype = {ECCC},
eprint = {TR13-191},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Savicky13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Saxena13,
author = {Nitin Saxena},
title = {Progress on Polynomial Identity Testing - {II}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-186}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/186},
eprinttype = {ECCC},
eprint = {TR13-186},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Saxena13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SayY13,
author = {A. C. Cem Say and
Abuzer Yakaryilmaz},
title = {Finite state verifiers with constant randomness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-004}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/004},
eprinttype = {ECCC},
eprint = {TR13-004},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SayY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SchwarzN13,
author = {Martin Schwarz and
Maarten Van den Nest},
title = {Simulating Quantum Circuits with Sparse Output Distributions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-154}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/154},
eprinttype = {ECCC},
eprint = {TR13-154},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SchwarzN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Selvam13,
author = {VyasRam Selvam},
title = {The two queries assumption and Arthur-Merlin classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-144}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/144},
eprinttype = {ECCC},
eprint = {TR13-144},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Selvam13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Sergeev13,
author = {Igor Sergeev},
title = {On the complexity of parallel prefix circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-041}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/041},
eprinttype = {ECCC},
eprint = {TR13-041},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Sergeev13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Sherstov13,
author = {Alexander A. Sherstov},
title = {Communication Lower Bounds Using Directional Derivatives},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-005}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/005},
eprinttype = {ECCC},
eprint = {TR13-005},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Sherstov13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Sherstov13a,
author = {Alexander A. Sherstov},
title = {Approximating the {AND-OR} Tree},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-023}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/023},
eprinttype = {ECCC},
eprint = {TR13-023},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Sherstov13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ShpilkaV13,
author = {Amir Shpilka and
Ben lee Volk},
title = {On the Structure of Boolean Functions with Small Spectral Norm},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-049}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/049},
eprinttype = {ECCC},
eprint = {TR13-049},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ShpilkaV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SunV13,
author = {Xiaoming Sun and
Marcos Villagra},
title = {Exponential Quantum-Classical Gaps in Multiparty Nondeterministic
Communication Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-110}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/110},
eprinttype = {ECCC},
eprint = {TR13-110},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SunV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Tzameret13,
author = {Iddo Tzameret},
title = {On Sparser Random 3SAT Refutation Algorithms and Feasible Interpolation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-070}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/070},
eprinttype = {ECCC},
eprint = {TR13-070},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Tzameret13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ValiantV13,
author = {Gregory Valiant and
Paul Valiant},
title = {Instance-by-instance optimal identity testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-111}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/111},
eprinttype = {ECCC},
eprint = {TR13-111},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ValiantV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Vereshchagin13,
author = {Nikolay K. Vereshchagin},
title = {Randomized communication complexity of appropximating Kolmogorov complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-178}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/178},
eprinttype = {ECCC},
eprint = {TR13-178},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Vereshchagin13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Viderman13,
author = {Michael Viderman},
title = {Strong LTCs with inverse poly-log rate and constant soundness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-022}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/022},
eprinttype = {ECCC},
eprint = {TR13-022},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Viderman13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Viola13,
author = {Emanuele Viola},
title = {Challenges in computational lower bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-119}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/119},
eprinttype = {ECCC},
eprint = {TR13-119},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Viola13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/WalfishB13,
author = {Michael Walfish and
Andrew J. Blumberg},
title = {Verifying computations without reexecuting them: from theoretical
possibility to near-practicality},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-165}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/165},
eprinttype = {ECCC},
eprint = {TR13-165},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/WalfishB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Watson13,
author = {Thomas Watson},
title = {The Complexity of Deciding Statistical Properties of Samplable Distributions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-124}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/124},
eprinttype = {ECCC},
eprint = {TR13-124},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Watson13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Worah13,
author = {Pratik Worah},
title = {A Short Excursion into Semi-Algebraic Hierarchies},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-017}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/017},
eprinttype = {ECCC},
eprint = {TR13-017},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Worah13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ZhengV13,
author = {Colin Jia Zheng and
Salil P. Vadhan},
title = {A Uniform Min-Max Theorem with Applications in Cryptography},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-101}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/101},
eprinttype = {ECCC},
eprint = {TR13-101},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ZhengV13.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-05-07 07:41 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:
