Neither reading few bits twice nor reading illegally helps much
type: Item
instance of: scholarly article
title: Neither reading few bits twice nor reading illegally helps much
zbMATH Open document ID: 0903.68074
DOI: 10.1016/S0166-218X(98)00042-0
author: Stasys Jukna
author: Alexander Razborov
published in: Discrete Applied Mathematics
publication date: 1998-08-20T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1192329
zbMATH Keywords: branching programs
zbMATH Keywords: semantic branching programs
MaRDI profile type: Publication
cites work: A lower bound for read-once-only branching programs
cites work: On lower bounds for read-\(k\)-times branching programs
cites work: Q3694708
cites work: Entropy of contact circuits and lower bounds on their complexity
cites work: A note on read-$k$ times branching programs
cites work: Q3821583
cites work: Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\)
cites work: Q4146667
cites work: Q5545524
cites work: Q3364203
cites work: A lower bound on branching programs reading some bits twice
cites work: New lower bounds and hierarchy results for restricted branching programs
cites work: Q3762226
cites work: On the complexity of branching programs and decision trees for clique functions
cites work: Q3347300
cites work: A superpolynomial lower bound for (1,+k(n))-branching programs
OpenAlex ID: W2054498950
description: scientific article; zbMATH DE number 1192329