Incremental branching programs
type: Item
instance of: scholarly article
title: Incremental branching programs
zbMATH Open document ID: 1141.68031
author: Anna Gál
author: Michal Koucký
author: Pierre McKenzie
published in: Theory of Computing Systems
publication date: 2008-06-17T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2006/623/
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5288690
zbMATH Keywords: GEN problems
MaRDI profile type: Publication
OpenAlex ID: W2107000858
cites work: Oracle branching programs and Logspace versus \(P^*\)
cites work: Time-space tradeoffs for branching programs
cites work: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
cites work: On lower bounds for read-\(k\)-times branching programs
cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
cites work: An observation on time-storage trade off
cites work: Space Lower Bounds for Maze Threadability on Restricted Machines
cites work: Tight Lower Bounds for st-Connectivity on the NNJAG Model
cites work: Incremental Branching Programs
cites work: Complete problems for deterministic polynomial time
cites work: A note on read-$k$ times branching programs
cites work: Space bounds for a game on graphs
cites work: Q4185781
cites work: Separation of the monotone NC hierarchy
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: Q3762226
cites work: Branching Programs and Binary Decision Diagrams
DOI: 10.1007/S00224-007-9049-Y
description: scientific article; zbMATH DE number 5288690