1990•Unpublished venueOpen access

Shared binary decision diagram with attributed edges for efficient Boolean function manipulation

Shin-ichi Minato, Nagisa Ishiura, Shuzo Yajima

Abstract

The efficiency of Boolean function manipulation depends on the form of representation of Boolean functions. Binary Decision Diagrams (BDD's) are graph representations proposed by Akers and Bryant. BDD's have some properties which can be used to enable efficient Boolean function manipulation.

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 367 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Binary decision diagram, Boolean function, And-inverter graph, Boolean expression, Computer science, Binary number, Representation (politics), Theoretical computer science