Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > SUBLOGARITHMIC COMPLEXITY BOUNDS:
Reports tagged with sublogarithmic complexity bounds:
TR95-005 | 1st January 1995
Maciej Liskiewicz, RĂ¼diger Reischuk

The Sublogarithmic Alternating Space World

This paper tries to fully characterize the properties and relationships
of space classes defined by Turing machines that use less than
logarithmic space - may they be deterministic,
nondeterministic or alternating (DTM, NTM or ATM).

We provide several examples of specific languages ... more >>>




ISSN 1433-8092 | Imprint