Almost All Functions Require Exponential Energy

DOI10.1007/978-3-662-48054-0_8zbMath1465.68075OpenAlexW1608997432MaRDI QIDQ2946379

Michele Scquizzato, Neal Barcelo, Michael Nugent, Kirk R. Pruhs

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48054-0_8

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (3)

Computing the best-case energy complexity of satisfying assignments in monotone circuits ⋮ 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: Almost All Functions Require Exponential Energy