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)

Related topics

Related topics

5 relations
Circuit complexityComputational complexity theoryComputer scienceCryptology ePrint Archive

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A New Approach for Constructing Low-Error, Two-Source Extractors
Our main contribution in this paper is a new reduction from explicit two-source extractors for polynomially-small entropy rate… 
2017
2017
Fourier-Based Testing for Families of Distributions
We study the general problem of testing whether an unknown distribution belongs to a specified family of distributions. More… 
2016
2016
Universal Locally Testable Codes
We initiate a study of “universal locally testable codes" (universal-LTCs). These codes admit local tests for membership in… 
2015
2015
On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits
This paper investigates the exact round complexity of zero-knowledge arguments of knowledge (ZKAOK) with strict-polynomial-time… 
2013
2013
A Integração das Vítimas nos Processos Penais - Um Novo Modelo para a Justiça Internacional?
O artigo analisa uma novidade no direito internacional penal: a participacao ativa das vitimas nos processos penais… 
2012
2012
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract)
We characterize the hitting sets for read-once branching programs of width 3 by a so-called richness condition which is… 
2010
2010
'Kaing Guek Eav Alias Duch', Judgment, ECCC, Case No 001/18-07- 2007/ECCC/TC (26 July 201
Duch, also known as Kaing Guek Eav, the former director of Phnom Penh's detention and torture center has been found guilty for… 
2009
2009
A simplified way of proving trade-off results for resolution
2001
2001
Combined error correcting and compressing codes
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
Testing of the long code and hardness for clique
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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)