Pages that link to "Item:Q3421380"
From MaRDI portal
The following pages link to On the Computational Power of Threshold Circuits with Sparse Activity (Q3421380):
Displayed 15 items.
- Energy and fan-in of logic circuits computing symmetric Boolean functions (Q393138) (← links)
- Energy and depth of threshold circuits (Q410715) (← links)
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions (Q627177) (← links)
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021) (← links)
- Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
- Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case (Q2151382) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Computing the best-case energy complexity of satisfying assignments in monotone circuits (Q2674710) (← links)
- ENERGY-EFFICIENT THRESHOLD CIRCUITS COMPUTING MOD FUNCTIONS (Q2841982) (← links)
- Energy and Fan-In of Threshold Circuits Computing Mod Functions (Q3010397) (← links)
- Size and Energy of Threshold Circuits Computing Mod Functions (Q3182969) (← links)
- Energy Complexity of Recurrent Neural Networks (Q5378352) (← links)
- On the relationship between energy complexity and other Boolean function measures (Q5918744) (← links)
- New bounds for energy complexity of Boolean functions (Q5918995) (← links)
- Size, Depth and Energy of Threshold Circuits Computing Parity Function. (Q6065463) (← links)