On the size of (generalized) OBDDs for threshold functions
type: Item
instance of: scholarly article
title: On the size of (generalized) OBDDs for threshold functions
zbMATH Open document ID: 1209.68151
author: Beate Bollig
published in: Information Processing Letters
publication date: 2010-08-16T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5771248
zbMATH Keywords: branching programs
zbMATH Keywords: computational complexity
zbMATH Keywords: ordered binary decision diagrams
zbMATH Keywords: threshold functions
describes a project that uses: azove
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.01.005
OpenAlex ID: W2161264634
cites work: On Threshold BDDs and the Optimal Variable Ordering Problem
cites work: Exact OBDD Bounds for Some Fundamental Functions
cites work: Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Q4471346
cites work: Symbolic graphs: Linear solutions to connectivity related problems
cites work: Size of ordered binary decision diagrams representing threshold functions
cites work: Q3352967
cites work: Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\)
cites work: Q5655273
cites work: Experimental and Efficient Algorithms
cites work: Reduction of OBDDs in linear time
cites work: Q4364580
cites work: Mathematical Foundations of Computer Science 2003
cites work: Symbolic topological sorting with OBDDs
DOI: 10.1016/J.IPL.2009.01.005
description: scientific article; zbMATH DE number 5771248