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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of combinatorial optimization Ročník 43; číslo 5; s. 1470 - 1492
Hlavní autoři:	Sun, Xiaoming, Sun, Yuan, Wu, Kewen, Xia, Zhiyu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.07.2022 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!