Size of ordered binary decision diagrams representing threshold functions
type: Item
instance of: scholarly article
title: Size of ordered binary decision diagrams representing threshold functions
zbMATH Open document ID: 0898.94018
DOI: 10.1016/S0304-3975(97)83807-8
author: K. Hosaka
author: T. Kaneda
author: Y. Takenaga
author: S. Yajima
published in: Theoretical Computer Science
publication date: 1998-07-22T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 1177588
zbMATH Keywords: ordered binary decision diagram
zbMATH Keywords: Boolean function
zbMATH Keywords: threshold functions
MaRDI profile type: Publication
cites work: Binary Decision Diagrams
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
cites work: Finding the optimal variable ordering for binary decision diagrams
cites work: On the OBDD-representation of general Boolean functions
cites work: On Complete Sets of Logic Primitives
cites work: Q5655273
cites work: Q4268445
cites work: A Lower Bound of the Number of Threshold Functions
full work available at URL: s0304-3975(97)83807-8
OpenAlex ID: W1976629341
description: scientific article; zbMATH DE number 1177588