Pages that link to "Item:Q955021"
From MaRDI portal
The following pages link to Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021):
Displaying 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)
- Lower bounds for constant-depth circuits in the presence of help bits (Q917289) (← links)
- Linear-size constant-depth polylog-threshold circuits (Q1182085) (← links)
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom (Q2365817) (← 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)
- 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)
