Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
type: Item
instance of: scholarly article
title: Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
zbMATH Open document ID: 0934.68048
author: Beate Bollig
author: Ingo Wegener
published in: Theory of Computing Systems
publication date: 1999-06-28T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1309897
zbMATH Keywords: ordered binary decision diagrams
MaRDI profile type: Publication
full work available at URL: s002240000128
OpenAlex ID: W1998134727
DOI: 10.1007/S002240000128
Recommended article: On the complexity of constructing optimal ordered binary decision diagrams
Recommended article: The Boolean hierarchy of NP-partitions
Recommended article: Q4501530
Recommended article: On the size of binary decision diagrams representing Boolean functions
Recommended article: Complexity Based on Partitioning of Boolean Circuits and their Relation to Multivalued Circuits
Recommended article: A characterization of binary decision diagrams
Recommended article: On the descriptive and algorithmic power of parity ordered binary decision diagrams
Recommended article: Q3397629
Recommended article: On the minimization of (complete) ordered binary decision diagrams
description: scientific article; zbMATH DE number 1309897