We study the complexity of classical constraint satisfaction problems on...
StoqMA characterizes the computational hardness of stoquastic local
Hami...
Despite the interest in the complexity class MA, the randomized analog o...
The derandomization of MA, the probabilistic version of NP, is a long
st...
share