Refinement of the Alternating Space Hierarchy

Authors

  • Viliam Geffert
  • Norbert Popély

Keywords:

Computational complexity, sublogarithmic space, alternation

Abstract

We refine the alternating space hierarchy by separating the classes break sgak spa(s(n)) and piak spa(s(n)) from deak spa(s(n)) as well as from break deak+1 spa(s(n)), for each s(n)in Omega(łlgn) cap o(łgn), and k geq 2. We also present unary (tally) sets separating sga2 spa(s(n)) and pia2 spa(s(n)) from break dea2 spa(s(n)) as well as from dea3 spa(s(n)).

Downloads

Download data is not yet available.

Downloads

Published

2012-02-21

How to Cite

Geffert, V., & Popély, N. (2012). Refinement of the Alternating Space Hierarchy. Computing and Informatics, 21(6), 607–616. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/477