A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
New Bounds for Energy Complexity of Boolean Functions
[article]
2020
arXiv
pre-print
For a Boolean function f:{0,1}^n →{0,1} computed by a circuit C over a finite basis ℬ, the energy complexity of C (denoted by _(C)) is the maximum over all inputs {0,1}^n the numbers of gates of the circuit C (excluding the inputs) that output a one. Energy Complexity of a Boolean function over a finite basis denoted by _(f):= min_C _(C) where C is a circuit over computing f. We study the case when = {_2, _2, ¬}, the standard Boolean basis. It is known that any Boolean function can be computed
arXiv:1808.07199v2
fatcat:ddq3tbnu3zdaxn24cnn3glpjm4