On the relationship between energy complexity and other Boolean function measures

DOI10.1007/978-3-030-26176-4_43MaRDI QIDQ5919451zbMATH OpenOpenAlexFDO

Authors Xiaoming Sun, Yu-An Sun, Kewen Wu, Zhiyu Xia

Publication date 24 February 2020

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

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

zbMATH Keywords

Boolean functioncircuit complexitydecision treeenergy complexity

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• On the relationship between energy complexity and other Boolean function measures
• New bounds for energy complexity of Boolean functions
• New bounds for energy complexity of Boolean functions
• Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions
• Energy Complexity and Depth of Threshold Circuits

Cited in

(5)

• Towards an energy complexity of computation
• Computing the best-case energy complexity of satisfying assignments in monotone circuits
• New bounds for energy complexity of Boolean functions
• Size, Depth and Energy of Threshold Circuits Computing Parity Function.
• Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions

This page was built for publication: On the relationship between energy complexity and other Boolean function measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919451)