31 search results - page 3 / 7 » eccc 2008 |
ECCC
2008
13 years 8 months ago
2008
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it,
ECCC
2008
13 years 8 months 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...
ECCC
2008
13 years 8 months 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
13 years 8 months ago
2008
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...
ECCC
2008
13 years 8 months ago
2008
In a two player game, a referee asks two cooperating players (who are not allowed to communicate) questions sampled from some distribution and decides whether they win or not base...