
PreviousNext
We study approximation hardness and satisfiability of bounded
occurrence uniform instances of SAT. Among other things, we prove
the inapproximability for SAT instances in which every clause has
exactly 3 literals and each variable occurs exactly 4 times,
and display an explicit ...
more >>>
We consider possible equality QMA=PP and give an argument
against it. Namely, this equality implies that PP contains PH. The argument is based on the strong form of Toda's theorem and
the strengthening of the proof for inclusion $QMA\subseteq PP$ due to Kitaev and Watrous.
We study bounded degree graph problems, mainly the problem of
k-Dimensional Matching \emph{(k-DM)}, namely, the problem of
finding a maximal matching in a k-partite k-uniform balanced
hyper-graph. We prove that k-DM cannot be efficiently approximated
to within a factor of $ O(\frac{k}{ \ln k}) $ unless $P = NP$.
This ...
more >>>
PreviousNext