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 2008Show all

1 paper · 1 filter

cs.CC2008★ 7 cited

A Note on the Inversion Complexity of Boolean Functions in Boolean Formulas

Hiroki Morizumi

In this note, we consider the minimum number of NOT operators in a Boolean formula representing a Boolean function. In circuit complexity theory, the minimum number of NOT gates in…