Chapter

Mathematical Foundations of Computer Science 2005

Volume 3618 of the series Lecture Notes in Computer Science pp 781-792

On Small Hard Leaf Languages

  • Falk UngerAffiliated withLancaster UniversityCentrum voor Wiskunde en Informatica (CWI)

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed concept for leaf languages, which allows us to give “short” representations for leaf words. We then use seeds to show that leaf languages A with NP ⊆ BLeaf P (A) cannot be polylog-sparse (i.e. census A O(log O(1))), unless PH collapses.

We also generalize balanced ≤\(^{P,{bit}}_{m}\)-reductions, which were introduced in [6], to other bit-reductions, for example (balanced) truth-table- and Turing-bit-reductions. Then, similarly to above, we prove that NP and Σ\(^{P}_{\rm 2}\) cannot have polylog-sparse hard sets under those balanced truth-table- and Turing-bit-reductions, if the polynomial-time hierarchy is infinite.

Keywords

Computational Complexity Leaf Languages Seeds Sparseness