ECCC
2008
15 years 22 days ago
2008
ECCC
2008
15 years 22 days ago
2008
113
Voted
ECCC
2008
15 years 22 days ago
2008
We show analogues of a theorem due to Valiant and Vazirani [16] for intractable parameterized complexity classes such as W[P], W[SAT] and the classes of the W-hierarchy as well as...
ECCC
2008
15 years 22 days ago
2008
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it,
75
Voted
ECCC
2008
15 years 22 days ago
2008
ECCC
2008
15 years 22 days ago
2008
106
Voted
ECCC
2008
15 years 22 days ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
ECCC
2008
15 years 22 days ago
2008
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
82
Voted
ECCC
2008
15 years 22 days ago
2008
Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with onesided error, has been an open problem for years. This note helps to explain why the problem is diffi...
109
Voted
ECCC
2008
15 years 22 days ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...