New bounds for energy complexity of Boolean functions

DOI10.1007/978-3-319-94776-1_61OpenAlexW2810735294MaRDI QIDQ5916262

Samir Otiv, M. N. Jayalal Sarma, Krishnamoorthy Dinesh

Publication date: 4 October 2018

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.07199

zbMATH Keywords

decision treesBoolean circuitsenergy complexity

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (4)

Asymptotically best synthesis methods for reflexive-recursive circuits ⋮ Size, Depth and Energy of Threshold Circuits Computing Parity Function. ⋮ New bounds for energy complexity of Boolean functions ⋮ On the relationship between energy complexity and other Boolean function measures

This page was built for publication: New bounds for energy complexity of Boolean functions