Pages that link to "Item:Q5918995"
From MaRDI portal
The following pages link to New bounds for energy complexity of Boolean functions (Q5918995):
Displaying 3 items.
- 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)
