Skip to search formSkip to main contentSkip to account menu

Electronic Colloquium on Computational Complexity

Known as: ECCC 
The Electronic Colloquium on Computational Complexity (ECCC) is an electronic archive of research papers in computational complexity theory, a branch… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Our main contribution in this paper is a new reduction from explicit two-source extractors for polynomially-small entropy rate… 
2016
2016
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational… 
2015
2015
We develop new techniques to incorporate the recently proposed “short code” (a low-degree version of the long code) into the… 
2012
2012
We characterize the hitting sets for read-once branching programs of width 3 by a so-called richness condition which is… 
2010
2010
Duch, also known as Kaing Guek Eav, the former director of Phnom Penh's detention and torture center has been found guilty for… 
2003
2003
  • M. Homeister
  • 2003
  • Corpus ID: 18473857
We prove the flrst lower bound for restricted read{once parity branching programs with unlimited parity nondeterminism where for… 
2001
2001
Traditionally the two encoding operations of compression and error detection/correction are at odds with one another. In the… 
Highly Cited
1996
Highly Cited
1996
We prove that unless NP = COR, Max Clique is hard to approximate wit hin polynomial time within a factor ni /2 ‘c for any c >0… 
1996
1996
The hypercube structure is a very widely used interconnection topology because of its appealing topological properties. For…