Space-efficient informational redundancy
type: Item
instance of: scholarly article
title: Space-efficient informational redundancy
zbMATH Open document ID: 1208.68128
author: Christian Glaßer
published in: Journal of Computer and System Sciences
publication date: 2010-10-07T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5796732
zbMATH Keywords: computational complexity
zbMATH Keywords: log-space reductions
zbMATH Keywords: autoreducibility
zbMATH Keywords: mitoticity
MaRDI profile type: MaRDI publication profile
full work available at URL: j.jcss.2010.03.005
OpenAlex ID: W2120788090
cites work: Q3337457
cites work: Relativized alternation and space-bounded computation
cites work: Deterministic coin tossing with applications to optimal parallel list ranking
cites work: Redundancy in Complete Sets
cites work: Non-mitotic Sets
cites work: The Priority Method I
cites work: A Completely Mitotic Nonrecursive R.E. Degree
cites work: Mitotic recursively enumerable sets
cites work: Relativization of questions about log space computability
cites work: Log space machines with multiple oracle tapes
cites work: Space-bounded hierarchies and probabilistic computations
cites work: Q5619818
cites work: A measure of relativized space which is faithful with respect to depth
DOI: 10.1016/J.JCSS.2010.03.005
Recommended article: Space-Efficient Informational Redundancy
Recommended article: Autoreducibility of complete sets for log-space and polynomial-time reductions
Recommended article: Autoreducibility and mitoticity of logspace-complete sets for NP and other classes
Recommended article: Introduction to autoreducibility and mitoticity
description: scientific article; zbMATH DE number 5796732