activity
20082023
most citedA Note on the Inversion Complexity of Boolean Functions in Boolean Formulas

7 citations · 7 across the 6 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.CC2016

Zero-Suppressed Computation: A New Computation Inspired by ZDDs

Hiroki Morizumi

Zero-suppressed binary decision diagrams (ZDDs) are a data structure representing Boolean functions, and one of the most successful variants of binary decision diagrams (BDDs). On…