A Sharp Separation on Sublogarithmic Space Complexity Classes.

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F03%3A06030013" target="_blank" >RIV/67985807:_____/03:06030013 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

A Sharp Separation on Sublogarithmic Space Complexity Classes.

Original language description

We present sharp separation results for sublogarithmic space complexity classes of the form: For any, arbitrarily slow growing, recursive nondecreasing and unbounded function s there is a natural k and an unary language L such that L is in SPACE(s(n)+k)but not in SPACE(s(n-1)). We use different types of so called demon (Turing) machines where the tape limit is given automatically without any construction, a very sensitive measure of space complexity of computations and succint diagonalization method.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F02%2F1456" target="_blank" >GA201/02/1456: Specialized computational models in contemporary computer science</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2003

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Computing and Informatics

ISSN

0350-5596

e-ISSN

—

Volume of the periodical

21

Issue of the periodical within the volume

N/A

Country of publishing house

SK - SLOVAKIA

Number of pages

8

Pages from-to

617-624

UT code for WoS article

—

EID of the result in the Scopus database

—