On oblivious branching programs of linear length
type: Item
instance of: scholarly article
title: On oblivious branching programs of linear length
zbMATH Open document ID: 0727.68038
DOI: 10.1016/0890-5401(91)90039-5
author: Matthias Krause
author: Stephan Waack
published in: Information and Computation
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4201613
zbMATH Keywords: decision graphs
zbMATH Keywords: graph accessibility problems
zbMATH Keywords: word problem of the free group
MaRDI profile type: Publication
full work available at URL: 0890-5401(91)90039-5
OpenAlex ID: W2054843454
cites work: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
cites work: Q3694708
cites work: Q3821583
cites work: Lower bounds for depth-restricted branching programs
cites work: Lower bounds on the complexity of real-time branching programs
cites work: Word Problems Solvable in Logspace
cites work: Das Identitätsproblem für Gruppen mit einer definierenden Relation
cites work: Q3779737
cites work: Q3804193
cites work: Q5545524
cites work: On the complexity of branching programs and decision trees for clique functions
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: Q3347300
description: scientific article; zbMATH DE number 4201613