Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/eccc/eccc17.bht:"
@article{DBLP:journals/eccc/Aaronson10, author = {Scott Aaronson}, title = {A Counterexample to the Generalized Linial-Nisan Conjecture}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-109}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/109}, eprinttype = {ECCC}, eprint = {TR10-109}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Aaronson10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Aaronson10a, author = {Scott Aaronson}, title = {The Equivalence of Sampling and Searching}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-128}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/128}, eprinttype = {ECCC}, eprint = {TR10-128}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Aaronson10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AaronsonA10, author = {Scott Aaronson and Alex Arkhipov}, title = {The Computational Complexity of Linear Optics}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-170}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/170}, eprinttype = {ECCC}, eprint = {TR10-170}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AaronsonA10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AaronsonABHM10, author = {Scott Aaronson and Baris Aydinlioglu and Harry Buhrman and John M. Hitchcock and Dieter van Melkebeek}, title = {A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-174}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/174}, eprinttype = {ECCC}, eprint = {TR10-174}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AaronsonABHM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AaronsonD10, author = {Scott Aaronson and Andrew Drucker}, title = {A Full Characterization of Quantum Advice}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-057}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/057}, eprinttype = {ECCC}, eprint = {TR10-057}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AaronsonD10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AaronsonM10, author = {Scott Aaronson and Dieter van Melkebeek}, title = {A note on circuit lower bounds from derandomization}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-105}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/105}, eprinttype = {ECCC}, eprint = {TR10-105}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AaronsonM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ajtai10, author = {Mikl{\'{o}}s Ajtai}, title = {Oblivious RAMs without Cryptographic Assumptions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-028}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/028}, eprinttype = {ECCC}, eprint = {TR10-028}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ajtai10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Allender10, author = {Eric Allender}, title = {Avoiding Simplicity is Complex}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-055}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/055}, eprinttype = {ECCC}, eprint = {TR10-055}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Allender10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AllenderAW10, author = {Eric Allender and Vikraman Arvind and Fengming Wang}, title = {Uniform Derandomization from Pathetic Lower Bounds}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-069}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/069}, eprinttype = {ECCC}, eprint = {TR10-069}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AllenderAW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AllenderFG10, author = {Eric Allender and Luke Friedman and William I. Gasarch}, title = {Exposition of the Muchnik-Positselsky Construction of a Prefix Free Entropy Function that is not Complete under Truth-Table Reductions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-138}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/138}, eprinttype = {ECCC}, eprint = {TR10-138}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AllenderFG10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AllenderFG10a, author = {Eric Allender and Luke Friedman and William I. Gasarch}, title = {Limits on the Computational Power of Random Strings}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-139}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/139}, eprinttype = {ECCC}, eprint = {TR10-139}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AllenderFG10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AllenderL10, author = {Eric Allender and Klaus{-}J{\"{o}}rn Lange}, title = {Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-070}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/070}, eprinttype = {ECCC}, eprint = {TR10-070}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AllenderL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AmbainisMRR10, author = {Andris Ambainis and Lo{\"{\i}}ck Magnin and Martin Roetteler and J{\'{e}}r{\'{e}}mie Roland}, title = {Symmetry-assisted adversaries for quantum state generation}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-191}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/191}, eprinttype = {ECCC}, eprint = {TR10-191}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AmbainisMRR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AndersonMV10, author = {Matthew Anderson and Dieter van Melkebeek and Ilya Volkovich}, title = {Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-188}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/188}, eprinttype = {ECCC}, eprint = {TR10-188}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AndersonMV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AroraG10, author = {Sanjeev Arora and Rong Ge}, title = {Learning Parities with Structured Noise}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-066}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/066}, eprinttype = {ECCC}, eprint = {TR10-066}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AroraG10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AroraIMS10, author = {Sanjeev Arora and Russell Impagliazzo and William Matthews and David Steurer}, title = {Improved Algorithms for Unique Games via Divide and Conquer}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-041}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/041}, eprinttype = {ECCC}, eprint = {TR10-041}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AroraIMS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AtseriasM10, author = {Albert Atserias and Elitza N. Maneva}, title = {Mean-payoff games and propositional proofs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-197}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/197}, eprinttype = {ECCC}, eprint = {TR10-197}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AtseriasM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BabuLV10, author = {Ajesh Babu and Nutan Limaye and Girish Varma}, title = {Streaming algorithms for some problems in log-space}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-094}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/094}, eprinttype = {ECCC}, eprint = {TR10-094}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BabuLV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BarakDWY10, author = {Boaz Barak and Zeev Dvir and Avi Wigderson and Amir Yehudayoff}, title = {Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-149}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/149}, eprinttype = {ECCC}, eprint = {TR10-149}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BarakDWY10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BarakKSSW10, author = {Boaz Barak and Guy Kindler and Ronen Shaltiel and Benny Sudakov and Avi Wigderson}, title = {Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-037}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/037}, eprinttype = {ECCC}, eprint = {TR10-037}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BarakKSSW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BeameM10, author = {Paul Beame and Widad Machmouchi}, title = {Making RAMs Oblivious Requires Superlogarithmic Overhead}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-104}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/104}, eprinttype = {ECCC}, eprint = {TR10-104}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BeameM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-AroyaET10, author = {Avraham Ben{-}Aroya and Klim Efremenko and Amnon Ta{-}Shma}, title = {Local list decoding with a constant number of queries}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-047}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/047}, eprinttype = {ECCC}, eprint = {TR10-047}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-AroyaET10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-AroyaET10a, author = {Avraham Ben{-}Aroya and Klim Efremenko and Amnon Ta{-}Shma}, title = {A Note on Amplifying the Error-Tolerance of Locally Decodable Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-134}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/134}, eprinttype = {ECCC}, eprint = {TR10-134}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-AroyaET10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-IsraelBK10, author = {Shir Ben{-}Israel and Eli Ben{-}Sasson and David R. Karger}, title = {Breaking local symmetries can dramatically reduce the length of propositional refutations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-068}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/068}, eprinttype = {ECCC}, eprint = {TR10-068}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-IsraelBK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-Sasson10, author = {Eli Ben{-}Sasson}, title = {Limitation on the rate of families of locally testable codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-123}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/123}, eprinttype = {ECCC}, eprint = {TR10-123}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-Sasson10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonJ10, author = {Eli Ben{-}Sasson and Jan Johannsen}, title = {Lower bounds for width-restricted clause learning on small width formulas}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-085}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/085}, eprinttype = {ECCC}, eprint = {TR10-085}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonJ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonK10, author = {Eli Ben{-}Sasson and Swastik Kopparty}, title = {Affine Dispersers from Subspace Polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-044}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/044}, eprinttype = {ECCC}, eprint = {TR10-044}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonMSS10, author = {Eli Ben{-}Sasson and Ghid Maatouk and Amir Shpilka and Madhu Sudan}, title = {Symmetric {LDPC} codes are not necessarily locally testable}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-199}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/199}, eprinttype = {ECCC}, eprint = {TR10-199}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonMSS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonN10, author = {Eli Ben{-}Sasson and Jakob Nordstr{\"{o}}m}, title = {Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-125}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/125}, eprinttype = {ECCC}, eprint = {TR10-125}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonS10, author = {Eli Ben{-}Sasson and Madhu Sudan}, title = {Limits on the rate of locally testable affine-invariant codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-108}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/108}, eprinttype = {ECCC}, eprint = {TR10-108}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonV10, author = {Eli Ben{-}Sasson and Michael Viderman}, title = {Low Rate Is Insufficient for Local Testability}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-004}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/004}, eprinttype = {ECCC}, eprint = {TR10-004}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonV10a, author = {Eli Ben{-}Sasson and Michael Viderman}, title = {Towards lower bounds on locally testable codes via density arguments}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-200}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/200}, eprinttype = {ECCC}, eprint = {TR10-200}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonV10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonZ10, author = {Eli Ben{-}Sasson and Noga Zewi}, title = {From Affine to Two-Source Extractors via Approximate Duality}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-144}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/144}, eprinttype = {ECCC}, eprint = {TR10-144}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BenabbasGM10, author = {Siavosh Benabbas and Konstantinos Georgiou and Avner Magen}, title = {The Sherali-Adams System Applied to Vertex Cover: Why Borsuk Graphs Fool Strong LPs and some Tight Integrality Gaps for SDPs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-169}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/169}, eprinttype = {ECCC}, eprint = {TR10-169}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BenabbasGM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BeyersdorffGL10, author = {Olaf Beyersdorff and Nicola Galesi and Massimo Lauria}, title = {Hardness of Parameterized Resolution}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-059}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/059}, eprinttype = {ECCC}, eprint = {TR10-059}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffGL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BeyersdorffGL10a, author = {Olaf Beyersdorff and Nicola Galesi and Massimo Lauria}, title = {A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-081}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/081}, eprinttype = {ECCC}, eprint = {TR10-081}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffGL10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BeyersdorffGLR10, author = {Olaf Beyersdorff and Nicola Galesi and Massimo Lauria and Alexander A. Razborov}, title = {Parameterized Bounded-Depth Frege is Not Optimal}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-198}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/198}, eprinttype = {ECCC}, eprint = {TR10-198}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffGLR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BhattacharyyaCSX10, author = {Arnab Bhattacharyya and Victor Chen and Madhu Sudan and Ning Xie}, title = {Testing linear-invariant non-linear properties: {A} short report}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-116}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/116}, eprinttype = {ECCC}, eprint = {TR10-116}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BhattacharyyaCSX10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BhattacharyyaFRV10, author = {Arnab Bhattacharyya and Eldar Fischer and Ronitt Rubinfeld and Paul Valiant}, title = {Testing monotonicity of distributions over general partial orders}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-027}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/027}, eprinttype = {ECCC}, eprint = {TR10-027}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BhattacharyyaFRV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BhattacharyyaGNX10, author = {Arnab Bhattacharyya and Elena Grigorescu and Jakob Nordstr{\"{o}}m and Ning Xie}, title = {Separations of Matroid Freeness Properties}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-136}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/136}, eprinttype = {ECCC}, eprint = {TR10-136}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BhattacharyyaGNX10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BhattacharyyaGS10, author = {Arnab Bhattacharyya and Elena Grigorescu and Asaf Shapira}, title = {A Unified Framework for Testing Linear-Invariant Properties}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-161}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/161}, eprinttype = {ECCC}, eprint = {TR10-161}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BhattacharyyaGS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BravermanR10, author = {Mark Braverman and Anup Rao}, title = {Efficient Communication Using Partial Information}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-083}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/083}, eprinttype = {ECCC}, eprint = {TR10-083}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BravermanR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BravermanR10a, author = {Mark Braverman and Anup Rao}, title = {Towards Coding for Maximum Errors in Interactive Communication}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-166}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/166}, eprinttype = {ECCC}, eprint = {TR10-166}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BravermanR10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BravermanRRY10, author = {Mark Braverman and Anup Rao and Ran Raz and Amir Yehudayoff}, title = {Pseudorandom Generators for Regular Branching Programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-035}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/035}, eprinttype = {ECCC}, eprint = {TR10-035}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BravermanRRY10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BryansCDKS10, author = {Nathaniel Bryans and Ehsan Chiniforooshan and David Doty and Lila Kari and Shinnosuke Seki}, title = {The Power of Nondeterminism in Self-Assembly}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-131}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/131}, eprinttype = {ECCC}, eprint = {TR10-131}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BryansCDKS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BuhrmanTUV10, author = {Harry Buhrman and Leen Torenvliet and Falk Unger and Nikolai K. Vereshchagin}, title = {Sparse Selfreducible Sets and Nonuniform Lower Bounds}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-163}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/163}, eprinttype = {ECCC}, eprint = {TR10-163}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BuhrmanTUV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/CarlucciGL10, author = {Lorenzo Carlucci and Nicola Galesi and Massimo Lauria}, title = {Paris-Harrington tautologies}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-153}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/153}, eprinttype = {ECCC}, eprint = {TR10-153}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/CarlucciGL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Chakrabarti10, author = {Amit Chakrabarti}, title = {A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-100}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/100}, eprinttype = {ECCC}, eprint = {TR10-100}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Chakrabarti10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChakrabartiCKM10, author = {Amit Chakrabarti and Graham Cormode and Ranganath Kondapally and Andrew McGregor}, title = {Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-076}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/076}, eprinttype = {ECCC}, eprint = {TR10-076}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChakrabartiCKM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChakrabartiR10, author = {Amit Chakrabarti and Oded Regev}, title = {An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-140}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/140}, eprinttype = {ECCC}, eprint = {TR10-140}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChakrabartiR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChakrabortyFM10, author = {Sourav Chakraborty and Eldar Fischer and Arie Matsliah}, title = {Query Complexity Lower Bounds for Reconstruction of Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-067}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/067}, eprinttype = {ECCC}, eprint = {TR10-067}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChakrabortyFM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChakrabortyGM10, author = {Sourav Chakraborty and David Garc{\'{\i}}a{-}Soriano and Arie Matsliah}, title = {Nearly Tight Bounds for Testing Function Isomorphism}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-093}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/093}, eprinttype = {ECCC}, eprint = {TR10-093}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChakrabortyGM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChattopadhyayTW10, author = {Arkadev Chattopadhyay and Jacobo Tor{\'{a}}n and Fabian Wagner}, title = {Graph Isomorphism is not {AC0} reducible to Group Isomorphism}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-117}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/117}, eprinttype = {ECCC}, eprint = {TR10-117}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayTW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/CheeFLWZ10, author = {Yeow Meng Chee and Tao Feng and San Ling and Huaxiong Wang and Liang Feng Zhang}, title = {Query-Efficient Locally Decodable Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-173}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/173}, eprinttype = {ECCC}, eprint = {TR10-173}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/CheeFLWZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChenDSS10, author = {Ho{-}Lin Chen and David Doty and Shinnosuke Seki and David Soloveichik}, title = {Parallelism, Program Size, Time, and Temperature in Self-Assembly}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-195}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/195}, eprinttype = {ECCC}, eprint = {TR10-195}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChenDSS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChenF10, author = {Yijia Chen and J{\"{o}}rg Flum}, title = {On optimal proof systems and logics for {PTIME}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-008}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/008}, eprinttype = {ECCC}, eprint = {TR10-008}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChenF10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChenF10a, author = {Zhixiang Chen and Bin Fu}, title = {The Complexity of Testing Monomials in Multivariate Polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-114}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/114}, eprinttype = {ECCC}, eprint = {TR10-114}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChenF10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChenF10b, author = {Zhixiang Chen and Bin Fu}, title = {Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-124}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/124}, eprinttype = {ECCC}, eprint = {TR10-124}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChenF10b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChenFLS10, author = {Zhixiang Chen and Bin Fu and Yang Liu and Robert T. Schweller}, title = {Algorithms for Testing Monomials in Multivariate Polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-122}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/122}, eprinttype = {ECCC}, eprint = {TR10-122}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChenFLS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChenSX10, author = {Victor Chen and Madhu Sudan and Ning Xie}, title = {Property Testing via Set-Theoretic Operations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-156}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/156}, eprinttype = {ECCC}, eprint = {TR10-156}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChenSX10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/CheraghchiHIS10, author = {Mahdi Cheraghchi and Johan H{\aa}stad and Marcus Isaksson and Ola Svensson}, title = {Approximating Linear Threshold Predicates}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-132}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/132}, eprinttype = {ECCC}, eprint = {TR10-132}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/CheraghchiHIS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/CohenS10, author = {Gil Cohen and Amir Shpilka}, title = {On the degree of symmetric functions on the Boolean cube}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-039}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/039}, eprinttype = {ECCC}, eprint = {TR10-039}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/CohenS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/CormodeTY10, author = {Graham Cormode and Justin Thaler and Ke Yi}, title = {Verifying Computations with Streaming Interactive Proofs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-159}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/159}, eprinttype = {ECCC}, eprint = {TR10-159}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/CormodeTY10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DattaKT10, author = {Samir Datta and Raghav Kulkarni and Raghunath Tewari}, title = {Perfect Matching in Bipartite Planar Graphs is in {UL}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-201}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/201}, eprinttype = {ECCC}, eprint = {TR10-201}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DattaKT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DattaKTV10, author = {Samir Datta and Raghav Kulkarni and Raghunath Tewari and N. V. Vinodchandran}, title = {Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-079}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/079}, eprinttype = {ECCC}, eprint = {TR10-079}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DattaKTV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DattaMRTV10, author = {Samir Datta and Meena Mahajan and B. V. Raghavendra Rao and Michael Thomas and Heribert Vollmer}, title = {Counting Classes and the Fine Structure between NC\({}^{\mbox{1}}\) and {L}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-101}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/101}, eprinttype = {ECCC}, eprint = {TR10-101}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DattaMRTV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DattaNTW10, author = {Samir Datta and Prajakta Nimbhorkar and Thomas Thierauf and Fabian Wagner}, title = {Graph Isomorphism for K\({}_{\mbox{3,3}}\)-free and K\({}_{\mbox{5}}\)-free graphs is in Log-space}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-050}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/050}, eprinttype = {ECCC}, eprint = {TR10-050}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DattaNTW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DellHW10, author = {Holger Dell and Thore Husfeldt and Martin Wahlen}, title = {Exponential Time Complexity of the Permanent and the Tutte Polynomial}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-078}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/078}, eprinttype = {ECCC}, eprint = {TR10-078}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DellHW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurM10, author = {Irit Dinur and Or Meir}, title = {Derandomized Parallel Repetition via Structured PCPs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-107}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/107}, eprinttype = {ECCC}, eprint = {TR10-107}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Drucker10, author = {Andrew Drucker}, title = {A {PCP} Characterization of {AM}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-019}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/019}, eprinttype = {ECCC}, eprint = {TR10-019}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Drucker10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Drucker10a, author = {Andrew Drucker}, title = {Improved Direct Product Theorems for Randomized Query Complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-080}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/080}, eprinttype = {ECCC}, eprint = {TR10-080}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Drucker10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DvirGRV10, author = {Zeev Dvir and Dan Gutfreund and Guy N. Rothblum and Salil P. Vadhan}, title = {On Approximating the Entropy of Polynomial Mappings}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-160}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/160}, eprinttype = {ECCC}, eprint = {TR10-160}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DvirGRV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DvirGY10, author = {Zeev Dvir and Parikshit Gopalan and Sergey Yekhanin}, title = {Matching Vector Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-012}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/012}, eprinttype = {ECCC}, eprint = {TR10-012}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DvirGY10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/EickmeyerG10, author = {Kord Eickmeyer and Martin Grohe}, title = {Randomisation and Derandomisation in Descriptive Complexity Theory}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-056}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/056}, eprinttype = {ECCC}, eprint = {TR10-056}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/EickmeyerG10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/EidelsteinS10, author = {Noa Eidelstein and Alex Samorodnitsky}, title = {Lower bounds for designs in symmetric spaces}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-120}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/120}, eprinttype = {ECCC}, eprint = {TR10-120}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/EidelsteinS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ElberfeldJT10, author = {Michael Elberfeld and Andreas Jakoby and Till Tantau}, title = {Logspace Versions of the Theorems of Bodlaender and Courcelle}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-062}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/062}, eprinttype = {ECCC}, eprint = {TR10-062}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ElberfeldJT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/FanghanelGHV10, author = {Alexander Fangh{\"{a}}nel and Sascha Geulen and Martin Hoefer and Berthold V{\"{o}}cking}, title = {Online Capacity Maximization in Wireless Networks}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-016}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/016}, eprinttype = {ECCC}, eprint = {TR10-016}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/FanghanelGHV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/FeffermanSUV10, author = {Bill Fefferman and Ronen Shaltiel and Christopher Umans and Emanuele Viola}, title = {On beating the hybrid argument}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-186}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/186}, eprinttype = {ECCC}, eprint = {TR10-186}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/FeffermanSUV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Feldman10, author = {Vitaly Feldman}, title = {A Complete Characterization of Statistical Query Learning with Applications to Evolvability}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-018}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/018}, eprinttype = {ECCC}, eprint = {TR10-018}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Feldman10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/FeldmanGRW10, author = {Vitaly Feldman and Venkatesan Guruswami and Prasad Raghavendra and Yi Wu}, title = {Agnostic Learning of Monomials by Halfspaces is Hard}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-185}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/185}, eprinttype = {ECCC}, eprint = {TR10-185}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/FeldmanGRW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/FeldmanLS10, author = {Vitaly Feldman and Homin K. Lee and Rocco A. Servedio}, title = {Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-022}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/022}, eprinttype = {ECCC}, eprint = {TR10-022}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/FeldmanLS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Fu10, author = {Bin Fu}, title = {{NE} is not {NP} Turing Reducible to Nonexpoentially Dense {NP} Sets}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-196}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/196}, eprinttype = {ECCC}, eprint = {TR10-196}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Fu10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Fu10a, author = {Bin Fu}, title = {Multivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-202}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/202}, eprinttype = {ECCC}, eprint = {TR10-202}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Fu10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Garcia-SorianoMCB10, author = {David Garc{\'{\i}}a{-}Soriano and Arie Matsliah and Sourav Chakraborty and Jop Bri{\"{e}}t}, title = {Monotonicity Testing and Shortest-Path Routing on the Cube}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-048}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/048}, eprinttype = {ECCC}, eprint = {TR10-048}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Garcia-SorianoMCB10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GavinskyI10, author = {Dmitry Gavinsky and Tsuyoshi Ito}, title = {Quantum Fingerprints that Keep Secrets}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-165}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/165}, eprinttype = {ECCC}, eprint = {TR10-165}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GavinskyI10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GavinskyS10, author = {Dmitry Gavinsky and Alexander A. Sherstov}, title = {A Separation of {NP} and coNP in Multiparty Communication Complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-060}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/060}, eprinttype = {ECCC}, eprint = {TR10-060}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GavinskyS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GlasserRSW10, author = {Christian Gla{\ss}er and Christian Reitwie{\ss}ner and Heinz Schmitz and Maximilian Witek}, title = {Hardness and Approximability in Multi-Objective Optimization}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-031}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/031}, eprinttype = {ECCC}, eprint = {TR10-031}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GlasserRSW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Goldreich10, author = {Oded Goldreich}, title = {On Testing Computability by Small Width OBDDs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-061}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/061}, eprinttype = {ECCC}, eprint = {TR10-061}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Goldreich10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Goldreich10a, author = {Oded Goldreich}, title = {Introduction to Testing Graph Properties}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-082}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/082}, eprinttype = {ECCC}, eprint = {TR10-082}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Goldreich10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Goldreich10b, author = {Oded Goldreich}, title = {In a World of P=BPP}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-135}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/135}, eprinttype = {ECCC}, eprint = {TR10-135}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Goldreich10b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GoldreichK10, author = {Oded Goldreich and Tali Kaufman}, title = {Proximity Oblivious Testing and the Role of Invariances}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-058}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/058}, eprinttype = {ECCC}, eprint = {TR10-058}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GoldreichK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GopalanKM10, author = {Parikshit Gopalan and Adam R. Klivans and Raghu Meka}, title = {Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-133}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/133}, eprinttype = {ECCC}, eprint = {TR10-133}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GopalanKM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GopalanMRZ10, author = {Parikshit Gopalan and Raghu Meka and Omer Reingold and David Zuckerman}, title = {Pseudorandom Generators for Combinatorial Shapes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-176}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/176}, eprinttype = {ECCC}, eprint = {TR10-176}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GopalanMRZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GopalanS10, author = {Parikshit Gopalan and Rocco A. Servedio}, title = {Learning and Lower Bounds for AC\({}^{\mbox{0}}\) with Threshold Gates}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-074}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/074}, eprinttype = {ECCC}, eprint = {TR10-074}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GopalanS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GoyalIMS10, author = {Vipul Goyal and Yuval Ishai and Mohammad Mahmoody and Amit Sahai}, title = {Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-020}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/020}, eprinttype = {ECCC}, eprint = {TR10-020}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GoyalIMS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GuruswamiHK10, author = {Venkatesan Guruswami and Johan H{\aa}stad and Swastik Kopparty}, title = {On the List-Decodability of Random Linear Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-003}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/003}, eprinttype = {ECCC}, eprint = {TR10-003}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GuruswamiHK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GuruswamiRSW10, author = {Venkatesan Guruswami and Prasad Raghavendra and Rishi Saket and Yi Wu}, title = {Bypassing {UGC} from some optimal geometric inapproximability results}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-177}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/177}, eprinttype = {ECCC}, eprint = {TR10-177}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GuruswamiRSW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GuruswamiS10, author = {Venkatesan Guruswami and Adam D. Smith}, title = {Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-077}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/077}, eprinttype = {ECCC}, eprint = {TR10-077}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GuruswamiS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GuruswamiS10a, author = {Venkatesan Guruswami and Ali Kemal Sinop}, title = {The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-111}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/111}, eprinttype = {ECCC}, eprint = {TR10-111}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GuruswamiS10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GuruswamiZ10, author = {Venkatesan Guruswami and Yuan Zhou}, title = {Tight Bounds on the Approximability of Almost-satisfiable Horn {SAT} and Exact Hitting Set\}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-063}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/063}, eprinttype = {ECCC}, eprint = {TR10-063}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GuruswamiZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Gutoski10, author = {Gus Gutoski}, title = {Interactive proofs with competing teams of no-signaling provers}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-187}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/187}, eprinttype = {ECCC}, eprint = {TR10-187}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Gutoski10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HaitnerMX10, author = {Iftach Haitner and Mohammad Mahmoody and David Xiao}, title = {A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of {NP}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-001}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/001}, eprinttype = {ECCC}, eprint = {TR10-001}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HaitnerMX10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HaitnerRV10, author = {Iftach Haitner and Omer Reingold and Salil P. Vadhan}, title = {Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-089}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/089}, eprinttype = {ECCC}, eprint = {TR10-089}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HaitnerRV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HatamiL10, author = {Hamed Hatami and Shachar Lovett}, title = {Higher-order Fourier analysis of F\({}_{\mbox{p}}\)\({}^{\mbox{n}}\) and the complexity of systems of linear forms}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-181}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/181}, eprinttype = {ECCC}, eprint = {TR10-181}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HatamiL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HemenwayO10, author = {Brett Hemenway and Rafail Ostrovsky}, title = {Building Injective Trapdoor Functions From Oblivious Transfer}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-127}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/127}, eprinttype = {ECCC}, eprint = {TR10-127}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HemenwayO10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HirschIMS10, author = {Edward A. Hirsch and Dmitry Itsykson and Ivan Monakhov and Alexander Smal}, title = {On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-193}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/193}, eprinttype = {ECCC}, eprint = {TR10-193}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HirschIMS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Hoang10, author = {Thanh Minh Hoang}, title = {Isolation of Matchings via Chinese Remaindering}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-194}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/194}, eprinttype = {ECCC}, eprint = {TR10-194}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Hoang10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HrubesWY10, author = {Pavel Hrubes and Avi Wigderson and Amir Yehudayoff}, title = {Non-commutative circuits and the sum-of-squares problem}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-021}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/021}, eprinttype = {ECCC}, eprint = {TR10-021}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HrubesWY10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HrubesWY10a, author = {Pavel Hrubes and Avi Wigderson and Amir Yehudayoff}, title = {Relationless completeness and separations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-040}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/040}, eprinttype = {ECCC}, eprint = {TR10-040}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HrubesWY10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HuangS10, author = {Hao Huang and Benny Sudakov}, title = {A counterexample to the Alon-Saks-Seymour conjecture and related problems}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-026}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/026}, eprinttype = {ECCC}, eprint = {TR10-026}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HuangS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ImpagliazzoK10, author = {Russell Impagliazzo and Valentine Kabanets}, title = {Constructive Proofs of Concentration Bounds}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-072}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/072}, eprinttype = {ECCC}, eprint = {TR10-072}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/JainN10, author = {Rahul Jain and Ashwin Nayak}, title = {The space complexity of recognizing well-parenthesized expressions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-071}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/071}, eprinttype = {ECCC}, eprint = {TR10-071}, timestamp = {Mon, 18 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/JainN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Jansen10, author = {Maurice J. Jansen}, title = {Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-118}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/118}, eprinttype = {ECCC}, eprint = {TR10-118}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Jansen10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/JansenQS10, author = {Maurice J. Jansen and Youming Qiao and Jayalal Sarma}, title = {Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-015}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/015}, eprinttype = {ECCC}, eprint = {TR10-015}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/JansenQS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/JansenQS10a, author = {Maurice J. Jansen and Youming Qiao and Jayalal Sarma}, title = {Deterministic Identity Testing of Read-Once Algebraic Branching Programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-084}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/084}, eprinttype = {ECCC}, eprint = {TR10-084}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/JansenQS10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/JiangZ10, author = {Haitao Jiang and Binhai Zhu}, title = {Weak Kernels}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-005}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/005}, eprinttype = {ECCC}, eprint = {TR10-005}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/JiangZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/JubaS10, author = {Brendan Juba and Madhu Sudan}, title = {Efficient Semantic Communication via Compatible Beliefs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-155}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/155}, eprinttype = {ECCC}, eprint = {TR10-155}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/JubaS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/JutlaR10, author = {Charanjit S. Jutla and Arnab Roy}, title = {A Completeness Theorem for Pseudo-Linear Functions with Applications to {UC} Security}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-092}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/092}, eprinttype = {ECCC}, eprint = {TR10-092}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/JutlaR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaneMN10, author = {Daniel Kane and Raghu Meka and Jelani Nelson}, title = {Almost Optimal Explicit Johnson-Lindenstrauss Transformations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-183}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/183}, eprinttype = {ECCC}, eprint = {TR10-183}, timestamp = {Thu, 04 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaneMN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaneN10, author = {Daniel M. Kane and Jelani Nelson}, title = {A Derandomized Sparse Johnson-Lindenstrauss Transform}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-098}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/098}, eprinttype = {ECCC}, eprint = {TR10-098}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaneN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Karnin10, author = {Zohar Shay Karnin}, title = {Deterministic Construction of a high dimensional l\({}_{\mbox{p}}\) section in l\({}_{\mbox{1}}\)\({}^{\mbox{n}}\) for any p{\textless}2}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-162}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/162}, eprinttype = {ECCC}, eprint = {TR10-162}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Karnin10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaufmanL10, author = {Tali Kaufman and Shachar Lovett}, title = {Testing of exponentially large codes, by a new extension to Weil bound for character sums}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-065}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/065}, eprinttype = {ECCC}, eprint = {TR10-065}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaufmanL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaufmanV10, author = {Tali Kaufman and Michael Viderman}, title = {Locally Testable vs. Locally Decodable Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-130}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/130}, eprinttype = {ECCC}, eprint = {TR10-130}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaufmanV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Kayal10, author = {Neeraj Kayal}, title = {Algorithms for Arithmetic Circuits}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-073}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/073}, eprinttype = {ECCC}, eprint = {TR10-073}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Kayal10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KayalS10, author = {Neeraj Kayal and Chandan Saha}, title = {On the Sum of Square Roots of Polynomials and related problems}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-189}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/189}, eprinttype = {ECCC}, eprint = {TR10-189}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KayalS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Khasianov10, author = {Airat Khasianov}, title = {Stronger Lower Bounds on Quantum {OBDD} for the Hidden Subgroup Problem}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-030}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/030}, eprinttype = {ECCC}, eprint = {TR10-030}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Khasianov10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KhotM10, author = {Subhash Khot and Dana Moshkovitz}, title = {NP-Hardness of Approximately Solving Linear Equations Over Reals}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-112}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/112}, eprinttype = {ECCC}, eprint = {TR10-112}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KhotM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KinneMS10, author = {Jeff Kinne and Dieter van Melkebeek and Ronen Shaltiel}, title = {Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-129}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/129}, eprinttype = {ECCC}, eprint = {TR10-129}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KinneMS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Kintali10, author = {Shiva Kintali}, title = {Realizable Paths and the {NL} vs {L} Problem}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-158}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/158}, eprinttype = {ECCC}, eprint = {TR10-158}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Kintali10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Kjos-Hanssen10, author = {Bj{\o}rn Kjos{-}Hanssen}, title = {A strong law of computationally weak subsets}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-150}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/150}, eprinttype = {ECCC}, eprint = {TR10-150}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Kjos-Hanssen10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KlartagR10, author = {Bo'az Klartag and Oded Regev}, title = {Quantum One-Way Communication is Exponentially Stronger Than Classical Communication}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-143}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/143}, eprinttype = {ECCC}, eprint = {TR10-143}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KlartagR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KlivansLW10, author = {Adam R. Klivans and Homin K. Lee and Andrew Wan}, title = {Mansour's Conjecture is True for Random {DNF} Formulas}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-023}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/023}, eprinttype = {ECCC}, eprint = {TR10-023}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KlivansLW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KoblerKLV10, author = {Johannes K{\"{o}}bler and Sebastian Kuhnert and Bastian Laubner and Oleg Verbitsky}, title = {Interval Graphs: Canonical Representation in Logspace}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-043}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/043}, eprinttype = {ECCC}, eprint = {TR10-043}, timestamp = {Thu, 13 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KoblerKLV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Kolla10, author = {Alexandra Kolla}, title = {Spectral Algorithms for Unique Games}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-029}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/029}, eprinttype = {ECCC}, eprint = {TR10-029}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Kolla10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KoppartySY10, author = {Swastik Kopparty and Shubhangi Saraf and Sergey Yekhanin}, title = {High-rate codes with sublinear-time decoding}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-148}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/148}, eprinttype = {ECCC}, eprint = {TR10-148}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KoppartySY10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KouckyNP10, author = {Michal Kouck{\'{y}} and Prajakta Nimbhorkar and Pavel Pudl{\'{a}}k}, title = {Pseudorandom Generators for Group Products}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-113}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/113}, eprinttype = {ECCC}, eprint = {TR10-113}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KouckyNP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Krajicek10, author = {Jan Kraj{\'{\i}}cek}, title = {On the proof complexity of the Nisan-Wigderson generator based on a hard {NP} cap coNP function}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-054}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/054}, eprinttype = {ECCC}, eprint = {TR10-054}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Krajicek10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KrebsLM10, author = {Andreas Krebs and Nutan Limaye and Meena Mahajan}, title = {Counting paths in {VPA} is complete for {\#}NC\({}^{\mbox{1}}\)}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-103}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/103}, eprinttype = {ECCC}, eprint = {TR10-103}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KrebsLM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LehreW10, author = {Per Kristian Lehre and Carsten Witt}, title = {Black-Box Search by Unbiased Variation}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-102}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/102}, eprinttype = {ECCC}, eprint = {TR10-102}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LehreW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LeviRR10, author = {Reut Levi and Dana Ron and Ronitt Rubinfeld}, title = {Testing Properties of Collections of Distributions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-157}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/157}, eprinttype = {ECCC}, eprint = {TR10-157}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LeviRR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Li10, author = {Xin Li}, title = {A New Approach to Affine Extractors and Dispersers}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-064}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/064}, eprinttype = {ECCC}, eprint = {TR10-064}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Li10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Li10a, author = {Xin Li}, title = {Improved Constructions of Three Source Extractors}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-190}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/190}, eprinttype = {ECCC}, eprint = {TR10-190}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Li10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett10, author = {Shachar Lovett}, title = {Equivalence of polynomial conjectures in additive combinatorics}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-010}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/010}, eprinttype = {ECCC}, eprint = {TR10-010}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett10a, author = {Shachar Lovett}, title = {An elementary proof of anti-concentration of polynomials in Gaussian variables}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-182}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/182}, eprinttype = {ECCC}, eprint = {TR10-182}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettMS10, author = {Shachar Lovett and Partha Mukhopadhyay and Amir Shpilka}, title = {Pseudorandom generators for CC\({}_{\mbox{0}}\)[p] and the Fourier spectrum of low-degree polynomials over finite fields}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-033}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/033}, eprinttype = {ECCC}, eprint = {TR10-033}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettMS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettP10, author = {Shachar Lovett and Ely Porat}, title = {A lower bound for dynamic approximate membership data structures}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-087}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/087}, eprinttype = {ECCC}, eprint = {TR10-087}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettV10, author = {Shachar Lovett and Emanuele Viola}, title = {Bounded-depth circuits cannot sample good codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-115}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/115}, eprinttype = {ECCC}, eprint = {TR10-115}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LutzS10, author = {Jack H. Lutz and Brad Shutters}, title = {Approximate Self-Assembly of the Sierpinski Triangle}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-032}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/032}, eprinttype = {ECCC}, eprint = {TR10-032}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LutzS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MagniezNSX10, author = {Fr{\'{e}}d{\'{e}}ric Magniez and Ashwin Nayak and Miklos Santha and David Xiao}, title = {Improved bounds for the randomized decision tree complexity of recursive majority}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-192}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/192}, eprinttype = {ECCC}, eprint = {TR10-192}, timestamp = {Mon, 18 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MagniezNSX10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Meir10, author = {Or Meir}, title = {{IP} = {PSPACE} using Error Correcting Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-137}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/137}, eprinttype = {ECCC}, eprint = {TR10-137}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Meir10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MelkebeekD10, author = {Dieter van Melkebeek and Holger Dell}, title = {Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-038}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/038}, eprinttype = {ECCC}, eprint = {TR10-038}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MelkebeekD10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MelkebeekW10, author = {Dieter van Melkebeek and Thomas Watson}, title = {Time-Space Efficient Simulations of Quantum Computations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-147}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/147}, eprinttype = {ECCC}, eprint = {TR10-147}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MelkebeekW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MicciancioV10, author = {Daniele Micciancio and Panagiotis Voulgaris}, title = {A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-014}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/014}, eprinttype = {ECCC}, eprint = {TR10-014}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MicciancioV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Moshkovitz10, author = {Dana Moshkovitz}, title = {An Alternative Proof of The Schwartz-Zippel Lemma}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-096}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/096}, eprinttype = {ECCC}, eprint = {TR10-096}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Moshkovitz10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Moshkovitz10a, author = {Michal Moshkovitz}, title = {Distance Estimators with Sublogarithmic Number of Queries}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-119}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/119}, eprinttype = {ECCC}, eprint = {TR10-119}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Moshkovitz10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MoshkovitzK10, author = {Dana Moshkovitz and Subhash Khot}, title = {Hardness of Approximately Solving Linear Equations Over Reals}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-053}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/053}, eprinttype = {ECCC}, eprint = {TR10-053}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MoshkovitzK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Nayak10, author = {Ashwin Nayak}, title = {Inverting a permutation is as hard as unordered search}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-121}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/121}, eprinttype = {ECCC}, eprint = {TR10-121}, timestamp = {Mon, 18 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Nayak10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Nordstrom10, author = {Jakob Nordstr{\"{o}}m}, title = {On the Relative Strength of Pebbling and Resolution}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-045}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/045}, eprinttype = {ECCC}, eprint = {TR10-045}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Nordstrom10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Pal10, author = {Manish Pal}, title = {Combinatorial Geometry of Graph Partitioning - {I}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-184}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/184}, eprinttype = {ECCC}, eprint = {TR10-184}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Pal10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/PavanTV10, author = {Aduri Pavan and Raghunath Tewari and N. V. Vinodchandran}, title = {On the Power of Unambiguity in Logspace}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-009}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/009}, eprinttype = {ECCC}, eprint = {TR10-009}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/PavanTV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Pich10, author = {J{\'{a}}n Pich}, title = {Nisan-Wigderson generators in proof systems with forms of interpolation}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-046}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/046}, eprinttype = {ECCC}, eprint = {TR10-046}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Pich10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Pospelov10, author = {Alexey Pospelov}, title = {Bounds for Bilinear Complexity of Noncommutative Group Algebras}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-049}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/049}, eprinttype = {ECCC}, eprint = {TR10-049}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Pospelov10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Pospelov10a, author = {Alexey Pospelov}, title = {Faster Polynomial Multiplication via Discrete Fourier Transforms}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-152}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/152}, eprinttype = {ECCC}, eprint = {TR10-152}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Pospelov10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/RaghavendraST10, author = {Prasad Raghavendra and David Steurer and Madhur Tulsiani}, title = {Reductions Between Expansion Problems}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-172}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/172}, eprinttype = {ECCC}, eprint = {TR10-172}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/RaghavendraST10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Raz10, author = {Ran Raz}, title = {Tensor-Rank and Lower Bounds for Arithmetic Formulas}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-002}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/002}, eprinttype = {ECCC}, eprint = {TR10-002}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Raz10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/RazR10, author = {Ran Raz and Ricky Rosen}, title = {A Strong Parallel Repetition Theorem for Projection Games on Expanders}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-142}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/142}, eprinttype = {ECCC}, eprint = {TR10-142}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/RazR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Reichardt10, author = {Ben Reichardt}, title = {Least span program witness size equals the general adversary lower bound on quantum query complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-075}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/075}, eprinttype = {ECCC}, eprint = {TR10-075}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Reichardt10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Reichardt10a, author = {Ben Reichardt}, title = {Span programs and quantum query algorithms}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-110}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/110}, eprinttype = {ECCC}, eprint = {TR10-110}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Reichardt10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Rothblum10, author = {Ron Rothblum}, title = {A Taxonomy of Enhanced Trapdoor Permutations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-145}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/145}, eprinttype = {ECCC}, eprint = {TR10-145}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Rothblum10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Rothblum10a, author = {Ron Rothblum}, title = {Homomorphic Encryption: from Private-Key to Public-Key}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-146}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/146}, eprinttype = {ECCC}, eprint = {TR10-146}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Rothblum10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/RudraU10, author = {Atri Rudra and Steve Uurtamo}, title = {Two Theorems in List Decoding}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-007}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/007}, eprinttype = {ECCC}, eprint = {TR10-007}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/RudraU10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/SaxenaS10, author = {Nitin Saxena and C. Seshadhri}, title = {From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-013}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/013}, eprinttype = {ECCC}, eprint = {TR10-013}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/SaxenaS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/SaxenaS10a, author = {Nitin Saxena and C. Seshadhri}, title = {Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-167}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/167}, eprinttype = {ECCC}, eprint = {TR10-167}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/SaxenaS10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Sherstov10, author = {Alexander A. Sherstov}, title = {Optimal bounds for sign-representing the intersection of two halfspaces by polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-025}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/025}, eprinttype = {ECCC}, eprint = {TR10-025}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Sherstov10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ShpilkaT10, author = {Amir Shpilka and Avishay Tal}, title = {On the Minimal Fourier Degree of Symmetric Boolean Functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-178}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/178}, eprinttype = {ECCC}, eprint = {TR10-178}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ShpilkaT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ShpilkaV10, author = {Amir Shpilka and Ilya Volkovich}, title = {Read-Once Polynomial Identity Testing}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-011}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/011}, eprinttype = {ECCC}, eprint = {TR10-011}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ShpilkaV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ShpilkaV10a, author = {Amir Shpilka and Ilya Volkovich}, title = {On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-036}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/036}, eprinttype = {ECCC}, eprint = {TR10-036}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ShpilkaV10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/SimaZ10, author = {Jiv{r}'{i} v{S}'{i}ma and Stanislav Z{\'{a}}k}, title = {A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-088}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/088}, eprinttype = {ECCC}, eprint = {TR10-088}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/SimaZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/StoleeV10, author = {Derrick Stolee and N. V. Vinodchandran}, title = {Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-154}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/154}, eprinttype = {ECCC}, eprint = {TR10-154}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/StoleeV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Sudan10, author = {Madhu Sudan}, title = {Invariance in Property Testing}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-051}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/051}, eprinttype = {ECCC}, eprint = {TR10-051}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Sudan10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/TewariV10, author = {Raghunath Tewari and N. V. Vinodchandran}, title = {Green's Theorem and Isolation in Planar Graphs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-151}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/151}, eprinttype = {ECCC}, eprint = {TR10-151}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/TewariV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Trevisan10, author = {Luca Trevisan}, title = {The Program-Enumeration Bottleneck in Average-Case Complexity Theory}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-034}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/034}, eprinttype = {ECCC}, eprint = {TR10-034}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Trevisan10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Tzameret10, author = {Iddo Tzameret}, title = {Algebraic Proofs over Noncommutative Formulas}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-097}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/097}, eprinttype = {ECCC}, eprint = {TR10-097}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Tzameret10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/UllmanV10, author = {Jonathan R. Ullman and Salil P. Vadhan}, title = {PCPs and the Hardness of Generating Synthetic Data}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-017}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/017}, eprinttype = {ECCC}, eprint = {TR10-017}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/UllmanV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Unger10, author = {Falk Unger}, title = {Better gates can make fault-tolerant computation impossible}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-164}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/164}, eprinttype = {ECCC}, eprint = {TR10-164}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Unger10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ValiantV10b, author = {Gregory Valiant and Paul Valiant}, title = {A {CLT} and tight lower bounds for estimating entropy}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-179}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/179}, eprinttype = {ECCC}, eprint = {TR10-179}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ValiantV10b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ValiantV10c, author = {Gregory Valiant and Paul Valiant}, title = {Estimating the unseen: {A} sublinear-sample canonical estimator of distributions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-180}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/180}, eprinttype = {ECCC}, eprint = {TR10-180}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ValiantV10c.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Vereshchagin10, author = {Nikolay K. Vereshchagin}, title = {Algorithmic Minimal Sufficient Statistics: a New Definition}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-090}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/090}, eprinttype = {ECCC}, eprint = {TR10-090}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Vereshchagin10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Vereshchagin10a, author = {Nikolay K. Vereshchagin}, title = {An Encoding Invariant Version of Polynomial Time Computable Distributions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-091}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/091}, eprinttype = {ECCC}, eprint = {TR10-091}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Vereshchagin10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viderman10, author = {Michael Viderman}, title = {A Note on high-rate Locally Testable Codes with sublinear query complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-171}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/171}, eprinttype = {ECCC}, eprint = {TR10-171}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viderman10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Vijayaraghavan10, author = {T. C. Vijayaraghavan}, title = {A Note on Closure Properties of ModL}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-099}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/099}, eprinttype = {ECCC}, eprint = {TR10-099}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Vijayaraghavan10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola10, author = {Emanuele Viola}, title = {Randomness buys depth for approximate counting}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-175}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/175}, eprinttype = {ECCC}, eprint = {TR10-175}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Watson10, author = {Thomas Watson}, title = {Relativized Worlds Without Worst-Case to Average-Case Reductions for {NP}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-042}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/042}, eprinttype = {ECCC}, eprint = {TR10-042}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Watson10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Watson10a, author = {Thomas Watson}, title = {Query Complexity in Errorless Hardness Amplification}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-126}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/126}, eprinttype = {ECCC}, eprint = {TR10-126}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Watson10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Watson10b, author = {Thomas Watson}, title = {Pseudorandom Generators for Combinatorial Checkerboards}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-168}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/168}, eprinttype = {ECCC}, eprint = {TR10-168}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Watson10b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/WinklerVG10, author = {Melanie Winkler and Berthold V{\"{o}}cking and Sascha Geulen}, title = {Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-052}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/052}, eprinttype = {ECCC}, eprint = {TR10-052}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/WinklerVG10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/WuOZG10, author = {Yi Wu and Ryan O'Donnell and David Zuckerman and Parikshit Gopalan}, title = {Fooling functions of halfspaces under product distributions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-006}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/006}, eprinttype = {ECCC}, eprint = {TR10-006}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/WuOZG10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Wunderlich10, author = {Henning Wunderlich}, title = {On a Theorem of Razborov}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-086}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/086}, eprinttype = {ECCC}, eprint = {TR10-086}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Wunderlich10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/WunderlichA10, author = {Henning Wunderlich and Stefan Arnold}, title = {On a singular value method in quantum communication complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-024}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/024}, eprinttype = {ECCC}, eprint = {TR10-024}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/WunderlichA10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Yamamoto10, author = {Masaki Yamamoto}, title = {A combinatorial analysis for the critical clause tree}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-095}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/095}, eprinttype = {ECCC}, eprint = {TR10-095}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Yamamoto10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Yoshida10, author = {Yuichi Yoshida}, title = {Optimal Constant-Time Approximation Algorithms and (Unconditional) Inapproximability Results for Every Bounded-Degree {CSP}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-106}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/106}, eprinttype = {ECCC}, eprint = {TR10-106}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Yoshida10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Raz10a, title = {A Strong Parallel Repetition Theorem for Projection Games on Expanders}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-141}}, year = {2010}, note = {Withdrawn.}, url = {https://eccc.weizmann.ac.il/report/2010/141}, eprinttype = {ECCC}, eprint = {TR10-141}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Raz10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.