Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions

DOI10.1515/DMA-2024-0018MaRDI QIDQ6599830

Mikhail A. Mestetskiy, Mikhail S. Shupletsov

Publication date: 6 September 2024

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

zbMATH Keywords

Boolean networkenergy complexitypositive sensitivityswitching complexity

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
• Energy Complexity of Recurrent Neural Networks
• New bounds for energy complexity of Boolean functions

This page was built for publication: Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions

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