Size, Depth and Energy of Threshold Circuits Computing Parity Function.
From MaRDI portal
Publication:6065463
Cites work
- Average-case lower bounds and satisfiability algorithms for small threshold circuits
- Bootstrapping results for threshold circuits ``just beyond known lower bounds
- Energy-efficient threshold circuits computing MOD functions
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
- Extremal combinatorics. With applications in computer science
- scientific article; zbMATH DE number 2081103 (Why is no real title available?)
- scientific article; zbMATH DE number 761425 (Why is no real title available?)
- scientific article; zbMATH DE number 872005 (Why is no real title available?)
- scientific article; zbMATH DE number 3314813 (Why is no real title available?)
- Lower bounds for threshold circuits of bounded energy
- Mathematical Foundations of Computer Science 2005
- Neural Network Learning
- New bounds for energy complexity of Boolean functions
- On the Computational Power of Threshold Circuits with Sparse Activity
- On the power of small-depth threshold circuits
- On the relationship between energy complexity and other Boolean function measures
- Size--Depth Tradeoffs for Threshold Circuits
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
- Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits
- The Sign-Rank of AC^0
- Threshold circuits of bounded depth
Cited in
(4)
This page was built for publication: Size, Depth and Energy of Threshold Circuits Computing Parity Function.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065463)
