Pages that link to "Item:Q5918995"
From MaRDI portal
The following pages link to New bounds for energy complexity of Boolean functions (Q5918995):
Displaying 8 items.
- Energy and fan-in of logic circuits computing symmetric Boolean functions (Q393138) (← links)
- Towards an energy complexity of computation (Q1607099) (← links)
- A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning (Q1626771) (← links)
- Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case (Q2151382) (← links)
- Computing the best-case energy complexity of satisfying assignments in monotone circuits (Q2674710) (← links)
- On the relationship between energy complexity and other Boolean function measures (Q5918744) (← links)
- Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions (Q6599830) (← links)
- Energy and output patterns in Boolean circuits (Q6636082) (← links)