Get started
Source

Electronic colloquium on computational complexity

ISSN: 1433-8092
Source type: journal
Alternate names: ECCC. Electronic colloquium on computational complexity, Electron. Colloquium Comput. Complex.
Fully OA: No
DOAJ: No
OpenAlex ID: S11189987
Generating Hard Instances of Lattice Problems
1996 · Miklós Ajtai · Electronic colloquium on computational complexity · 595
The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions.
1997 · Miklós Ajtai · Electronic colloquium on computational complexity · 238
Settling the Complexity of 2-Player Nash-Equilibrium
2005 · Xi Chen, Xiaotie Deng · Electronic colloquium on computational complexity · 187
Clique is hard to approximate within n 1-epsilon
1997 · Johan Håstad · Electronic colloquium on computational complexity · 146
The median problems for breakpoints are NP-complete
1998 · Itsik Pe’er, Ron Shamir · Electronic colloquium on computational complexity · 123
A Survey on Distribution Testing: Your Data is Big. But is it Blue?
2015 · Clément L. Canonne · Electronic colloquium on computational complexity · 83
On Yao's XOR-Lemma
1995 · Oded Goldreich, Noam Nisan, et al. · Electronic colloquium on computational complexity · 77
New Lower Bounds for General Locally Decodable Codes.
2007 · David P. Woodruff · Electronic colloquium on computational complexity · 75
A CLT and tight lower bounds for estimating entropy.
2010 · Gregory Valiant, Paul Valiant · Electronic colloquium on computational complexity · 69
Adaptive Algorithms for Online Decision Problems
2007 · Elad Hazan, C. Seshadhri · Electronic colloquium on computational complexity · 63
Bounds on Linear Codes for Network Multicast
2003 · Meir Feder, Dana Ron, et al. · Electronic colloquium on computational complexity · 60
An exponential lower bound for the sum of powers of bounded degree polynomials.
2012 · Neeraj Kayal · Electronic colloquium on computational complexity · 59
The complexity of computing a Nash equilibrium
2005 · Konstantinos S. Daskalakis, Paul W. Goldberg, et al. · Electronic colloquium on computational complexity · 58
Improved Approximation Lower Bounds on Small Occurrence Optimization
2003 · Piotr Berman, Marek Karpiński · Electronic colloquium on computational complexity · 54
Mal'tsev constraints are tractable
2002 · Andreǐ A. Bulatov · Electronic colloquium on computational complexity · 50
On Extracting Randomness From Weak Random Sources
1995 · Amnon Ta‐Shma · Electronic colloquium on computational complexity · 47
Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover.
2016 · Irit Dinur · Electronic colloquium on computational complexity · 45
On Promise Problems (a survey in memory of Shimon Even [1935-2004])
2005 · Oded Goldreich · Electronic colloquium on computational complexity · 37
Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs
1999 · Oliver Kullmann · Electronic colloquium on computational complexity · 36
Pseudorandomness for Permutation Branching Programs Without the Group Theory.
2012 · Thomas Steinke · Electronic colloquium on computational complexity · 32
Probabilistic Search Algorithms with Unique Answers and Their Cryptographic Applications.
2011 · Eran Gat, Shafi Goldwasser · Electronic colloquium on computational complexity · 31
Estimating the unseen: A sublinear-sample canonical estimator of distributions.
2010 · Gregory Valiant, Paul Valiant · Electronic colloquium on computational complexity · 30
Verifying computations without reexecuting them: from theoretical possibility to near-practicality.
2013 · Michael Walfish, Andrew J. Blumberg · Electronic colloquium on computational complexity · 29
Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm
1997 · Russell Impagliazzo, Pavel Pudlák, et al. · Electronic colloquium on computational complexity · 27
Simplified Separation of Information and Communication.
2015 · Anup Rao, Makrand Sinha · Electronic colloquium on computational complexity · 26
Works count: 583
Citation count: 4,153
H-index: 26
I10-index: 81
2yr mean citedness:
Year
Topic
Type