On arithmetic branching programs
type: Item
instance of: scholarly article
title: On arithmetic branching programs
zbMATH Open document ID: 0948.68071
author: Amos Beimel
author: Anna Gál
published in: Journal of Computer and System Sciences
publication date: 2000-11-22T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1389783
zbMATH Keywords: arithmetic branching programs
MaRDI profile type: Publication
cites work: Q4228466
cites work: Q4228516
cites work: Lower bounds for monotone span programs
cites work: On computing the determinant in small parallel time using a small number of processors
cites work: Fast parallel matrix and GCD computations
cites work: On lower bounds for read-\(k\)-times branching programs
cites work: Structure and importance of logspace-MOD class
cites work: Q4542561
cites work: Q4259990
cites work: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
cites work: Q4375799
cites work: Making Nondeterminism Unambiguous
cites work: Q4001780
cites work: Q4385517
description: scientific article; zbMATH DE number 1389783