SearcharxivSearch

arXiv · cs/9808002

Downward Collapse from a Weaker Hypothesis

Abstract

Hemaspaandra et al. proved that, for $m > 0$ and $0 < i < k - 1$: if $Σ_i^p \BoldfaceDelta DIFF_m(Σ_k^p)$ is closed under complementation, then $DIFF_m(Σ_k^p) = coDIFF_m(Σ_k^p)$. This sharply asymmetric result fails to apply to the case in which the hypothesis is weakened by allowing the $Σ_i^p$ to be replaced by any class in its difference hierarchy. We so extend the result by proving that, for $s,m > 0$ and $0 < i < k - 1$: if $DIFF_s(Σ_i^p) \BoldfaceDelta DIFF_m(Σ_k^p)$ is closed under complementation, then $DIFF_m(Σ_k^p) = coDIFF_m(Σ_k^p)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel. 1998-08-24. Downward Collapse from a Weaker Hypothesis. https://arxiv.org/abs/cs/9808002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC