Size, Depth and Energy of Threshold Circuits Computing Parity Function.

DOI10.4230/lipics.isaac.2020.54OpenAlexW3113839980MaRDI QIDQ6065463

Kei Uchizawa

Publication date: 14 November 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/13398/pdf/LIPIcs-ISAAC-2020-54.pdf/

zbMATH Keywords

neural networkstradeoffscircuit complexitythreshold circuitssprase activity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
• On the power of small-depth threshold circuits
• Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
• Threshold circuits of bounded depth
• ENERGY-EFFICIENT THRESHOLD CIRCUITS COMPUTING MOD FUNCTIONS
• The Sign-Rank of AC$^0$
• Extremal Combinatorics
• On the Computational Power of Threshold Circuits with Sparse Activity
• Size--Depth Tradeoffs for Threshold Circuits
• Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits
• Neural Network Learning
• Bootstrapping results for threshold circuits “just beyond” known lower bounds
• Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits
• Lower Bounds for Threshold Circuits of Bounded Energy
• Mathematical Foundations of Computer Science 2005
• New bounds for energy complexity of Boolean functions
• On the relationship between energy complexity and other Boolean function measures

This page was built for publication: Size, Depth and Energy of Threshold Circuits Computing Parity Function.