Energy and output patterns in Boolean circuits
From MaRDI portal
Publication:6636082
DOI10.1007/978-981-97-2340-9_16MaRDI QIDQ6636082
Jayalal Sarma M. N., Kei Uchizawa
Publication date: 12 November 2024
Cites Work
- Title not available (Why is that?)
- Energy and fan-in of logic circuits computing symmetric Boolean functions
- Boolean function complexity. Advances and frontiers.
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
- A linear lower bound on the unbounded error probabilistic communication complexity.
- Computing the best-case energy complexity of satisfying assignments in monotone circuits
- On the Computational Power of Threshold Circuits with Sparse Activity
- On the relationship between energy complexity and other Boolean function measures
- New bounds for energy complexity of Boolean functions
- Size, Depth and Energy of Threshold Circuits Computing Parity Function.
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)
