Energy and output patterns in Boolean circuits

DOI10.1007/978-981-97-2340-9_16MaRDI QIDQ6636082zbMATH OpenFDO

Authors Jayalal Sarma M. N., Kei Uchizawa

Publication date 12 November 2024

Full work available at URL https://doi.org/10.1007/978-981-97-2340-9_16

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A linear lower bound on the unbounded error probabilistic communication complexity.
• Boolean function complexity. Advances and frontiers.
• Computing the best-case energy complexity of satisfying assignments in monotone circuits
• Energy and fan-in of logic circuits computing symmetric Boolean functions
• Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
• scientific article; zbMATH DE number 609988 (Why is no real title available?)
• New bounds for energy complexity of Boolean functions
• On the Computational Power of Threshold Circuits with Sparse Activity
• On the relationship between energy complexity and other Boolean function measures
• Size, Depth and Energy of Threshold Circuits Computing Parity Function.

Cited in

(2)

• On saving energy in Boolean circuits via negations
• Upper bound for output patterns of energy-bounded Boolean circuits, and its applications

This page was built for publication: Energy and output patterns in Boolean circuits

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