A note on logspace optimization
type: Item
instance of: scholarly article
title: A note on logspace optimization
zbMATH Open document ID: 0838.68036
DOI: 10.1007/BF01268143
author: Carme Àlvarez
author: Birgit Jenner
published in: Computational Complexity
publication date: 1996-05-27T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 829925
zbMATH Keywords: complexity classes
zbMATH Keywords: word matrices
zbMATH Keywords: nondeterministic logspace functions
MaRDI profile type: Publication
cites work: The complexity of computing maximal word functions
cites work: A very hard log-space counting class
cites work: Adaptive logspace reducibility and parallel time
cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
cites work: Circuits, matrices, and nonassociative computation
cites work: Computing Algebraic Formulas Using a Constant Number of Registers
cites work: Q4266544
cites work: Constant Depth Reducibility
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Problems complete for deterministic logarithmic space
cites work: Nondeterministic Space is Closed under Complementation
cites work: The complexity of iterated multiplication
cites work: Positive Relativizations of Complexity Classes
cites work: The method of forced enumeration for nondeterministic automata
full work available at URL: https://doi.org/10.1007/bf01268143
OpenAlex ID: W2002941015
description: scientific article; zbMATH DE number 829925