On the relationship between energy complexity and other boolean function measures

We focus on energy complexity , a Boolean function measure related closely to Boolean circuit design. Given a circuit C over the standard basis { ∨ 2 , ∧ 2 , ¬ } , the energy complexity of C , denoted by EC ( C ) , is the maximum number of its activated inner gates over all inputs. The energy comple...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 43; no. 5; pp. 1470 - 1492
Main Authors:	Sun, Xiaoming, Sun, Yuan, Wu, Kewen, Xia, Zhiyu
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2022 Springer Nature B.V
Subjects:	Boolean Boolean algebra Boolean functions Circuit design Combinatorial analysis Combinatorics Complexity Computation Convex and Discrete Geometry Decision trees Energy Gates (circuits) Lower bounds Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Theory of Computation Tightness Upper bounds Energy complexity Boolean function Decision tree Circuit complexity
ISSN:	1382-6905, 1573-2886
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!