Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > ONLINE SPACE COMPLEXITY:
Reports tagged with Online Space Complexity:
TR16-107 | 17th July 2016
Nathanael Fijalkow

Lower Bounds for Alternating Online Space Complexity

Revisions: 1

The notion of online space complexity, introduced by Karp in 1967, quantifies the amount of states required to solve a given problem using an online algorithm,
represented by a machine which scans the input exactly once from left to right.
In this paper, we study alternating machines as introduced by ... more >>>




ISSN 1433-8092 | Imprint