Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2402.00791

Hausdorff Reductions and the Exponential Hierarchies

Enrico Malizia
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce Hausdorff (complexity) classes, which yield canonical normal forms for the intermediate levels of the iterated exponential hierarchies, including the Polynomial Hierarchy, the (Weak) Exponential Hierarchy, and higher-order exponential hierarchies. Just as certificates capture main hierarchy levels without oracles, Hausdorff classes give an oracle-free characterization of the intermediate hierarchy levels. The Hausdorff perspective provides a unifying structural explanation for many known equivalences between oracle classes. Indeed, seemingly different oracle classes corresponding to the same intermediate level are shown to arise from just three distinct yet equivalent oracle-aided ways of deciding languages in a single Hausdorff class, replacing multiple oracleh-based views with a unique characterization. Moreover, it explains the collapse of the Strong Exponential Hierarchy, showing that $\mathrm{P}^{\mathrm{NExp}} = \mathrm{NP}^{\mathrm{NExp}}$ because both classes coincide with the same Hausdorff class, thereby resolving a question of Hemachandra. Finally, we define canonical complete problems for $\mathrm{P}^{\mathrm{NExp[\mathrm{Log}]}}$ and $\mathrm{P}^{\mathrm{NExp}}$, yielding matching lower bounds for problems whose hardness had remained open due to the lack of suitable hard problems to reduce from.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Enrico Malizia. 2024-02-01. Hausdorff Reductions and the Exponential Hierarchies. https://arxiv.org/abs/2402.00791

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

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↗