The Polynomial Hierarchy does not collapse

Reiner Czerwinski

Home/Archive/arXiv

arXiv · 2405.18439

The Polynomial Hierarchy does not collapse

Reiner Czerwinski

View original source ↗Read source document ↗Export metadata ↓

Abstract

The arithmetical hierarchy (AH) is similar to the polynomial hierarchy (PH). Unlike the PH, the AH does not collapse relative to any oracle. A language in the (k + 1)-st level of the AH is computable enumerable (c.e.) relative to the kth level. So, given an oracle in the kth level of the AH, we could use a black-box search to decide whether the input word is in the language. With very large padding arguments, i.e. the paddings grow faster than any relative to the level k of the AH computable function, we would construct a language contained in the k + 1 level of PH, if we use only a finite set of input words. From the oracle in AH, we would construct an analogue oracle at the kth level of PH. For the input words of the finite set, a word is in the language of AH, if and only if it is in the language of PH. And the input word is in the oracle set of AH, if and only if it is in the oracle of PH. As in the language of AH, we must apply a black-box search in the language of PH. So, we would also have exponentially many oracle queries in the language of PH. The PH does not collapse.

Explore related subjects

cs.CC cs.FL

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Reiner Czerwinski. 2024-04-17. The Polynomial Hierarchy does not collapse. https://arxiv.org/abs/2405.18439

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

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↗