scientific article
From MaRDI portal
Publication:3352967
zbMath0728.94012MaRDI QIDQ3352967
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Exponential space complexity for OBDD-based reachability analysis ⋮ A note on read-$k$ times branching programs ⋮ On BPP versus \(NP\cup coNP\) for ordered read-once branching programs ⋮ On the size of (generalized) OBDDs for threshold functions ⋮ A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs ⋮ Unnamed Item
This page was built for publication: