Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,300 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Circuit complexity
Computational complexity theory
Computer science
Cryptology ePrint Archive
Expand
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
Avraham Ben-Aroya
,
Eshan Chattopadhyay
,
Dean Doron
,
Xin Li
,
A. Ta-Shma
Cybersecurity and Cyberforensics Conference
2018
Corpus ID: 44137712
Our main contribution in this paper is a new reduction from explicit two-source extractors for polynomially-small entropy rate…
Expand
2016
2016
Structural sparseness and complex networks
F. Reidl
2016
Corpus ID: 39368113
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational…
Expand
2015
2015
PCPs via the low-degree long code and hardness for constrained hypergraph coloring
Irit Dinur
,
V. Guruswami
Israel Journal of Mathematics
2015
Corpus ID: 14941852
We develop new techniques to incorporate the recently proposed “short code” (a low-degree version of the long code) into the…
Expand
2012
2012
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract)
Jirí Síma
,
S. Zák
Conference on Current Trends in Theory and…
2012
Corpus ID: 3018830
We characterize the hitting sets for read-once branching programs of width 3 by a so-called richness condition which is…
Expand
2010
2010
'Kaing Guek Eav Alias Duch', Judgment, ECCC, Case No 001/18-07- 2007/ECCC/TC (26 July 201
R. Dubler
2010
Corpus ID: 108592817
Duch, also known as Kaing Guek Eav, the former director of Phnom Penh's detention and torture center has been found guilty for…
Expand
2009
2009
A simplified way of proving trade-off results for resolution
Jakob Nordström
Information Processing Letters
2009
Corpus ID: 6492941
2003
2003
Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs
M. Homeister
Electron. Colloquium Comput. Complex.
2003
Corpus ID: 18473857
We prove the flrst lower bound for restricted read{once parity branching programs with unlimited parity nondeterminism where for…
Expand
2001
2001
Combined error correcting and compressing codes
T. Wenisch
,
P. Swaszek
,
A. Uht
Proceedings. IEEE International Symposium on…
2001
Corpus ID: 62499036
Traditionally the two encoding operations of compression and error detection/correction are at odds with one another. In the…
Expand
Highly Cited
1996
Highly Cited
1996
Testing of the long code and hardness for clique
J. Håstad
Symposium on the Theory of Computing
1996
Corpus ID: 14683039
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…
Expand
1996
1996
The Extended Cube Connected Cycles: An Efficient Interconnection for Massively Parallel Systems
R. Ayoubi
,
Q. Malluhi
,
M. Bayoumi
IEEE Trans. Computers
1996
Corpus ID: 41192737
The hypercube structure is a very widely used interconnection topology because of its appealing topological properties. For…
Expand
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)
ACCEPT & CONTINUE