Threshold circuits of small majority-depth
From MaRDI portal
Recommendations
- On the power of small-depth threshold circuits
- Threshold circuits of bounded depth
- On small depth threshold circuits
- On the Power of Threshold Circuits with Small Weights
- Bounds on the Size of Small Depth Circuits for Approximating Majority
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
- Mathematical Foundations of Computer Science 2005
- Simulating Threshold Circuits by Majority Circuits
- Size--Depth Tradeoffs for Threshold Circuits
- Exponential lower bound for bounded depth circuits with few threshold gates
Cites work
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- Bounded-depth, polynomial-size circuits for symmetric functions
- Constant Depth Reducibility
- Definability by constant-depth polynomial-size circuits
- Depth efficient neural networks for division and related problems
- Depth-size tradeoffs for neural computation
- Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
- Harmonic Analysis of Polynomial Threshold Functions
- scientific article; zbMATH DE number 3566175 (Why is no real title available?)
- scientific article; zbMATH DE number 512859 (Why is no real title available?)
- scientific article; zbMATH DE number 512860 (Why is no real title available?)
- scientific article; zbMATH DE number 3799016 (Why is no real title available?)
- Log Depth Circuits for Division and Related Problems
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Majority gates vs. general weighted threshold gates
- On ACC
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
- On the Power of Threshold Circuits with Small Weights
- Parity, circuits, and the polynomial-time hierarchy
- Simulating threshold circuits by majority circuits
- Some notes on threshold circuits, and multiplication in depth 4
- The complexity of iterated multiplication
- Threshold circuits of bounded depth
- When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one
Cited in
(33)- Some notes on threshold circuits, and multiplication in depth 4
- An arithmetic model of computation equivalent to threshold circuits
- Upper and lower bounds for some depth-3 circuit classes
- Efficient threshold circuits for power series
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\)
- Computing majority by constant depth majority circuits with low fan-in gates
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\)
- Minimal feedforward parity networks using threshold gates
- Low-depth uniform threshold circuits and the bit-complexity of straight line programs
- Parity, circuits, and the polynomial-time hierarchy
- Generating classification circuits for approximating biological decision problems
- Decomposition of threshold functions into bounded fan-in threshold functions
- On Threshold Circuits and Polynomial Computation
- scientific article; zbMATH DE number 512860 (Why is no real title available?)
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
- Simulating Threshold Circuits by Majority Circuits
- 2-1 addition and related arithmetic operations with threshold logic
- Threshold Circuits for Iterated Matrix Product and Powering
- scientific article; zbMATH DE number 1754141 (Why is no real title available?)
- On realizing iterated multiplication by small depth threshold circuits
- scientific article; zbMATH DE number 773998 (Why is no real title available?)
- Quantum hardness of learning shallow classical circuits
- Parity helps to compute majority
- Efficient Construction of Rigid Matrices Using an NP Oracle
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
- Algebraic algorithms for variants of subset sum
- Depth-efficient threshold circuits for multiplication and symmetric function computation
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
- On the power of small-depth threshold circuits
- Efficient construction of rigid matrices using an NP oracle
- \#SAT-algorithms for classes of threshold circuits based on probabilistic rank
- Powering requires threshold depth 3
This page was built for publication: Threshold circuits of small majority-depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273878)
