On the computational power of depth 2 circuits with threshold and modulo gates
DOI10.1145/195058.195103zbMATH Open1345.68130OpenAlexW2097957732MaRDI QIDQ2817596FDOQ2817596
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195103
Recommendations
- On the computational power of depth-2 circuits with threshold and modulo gates
- A note on the power of majority gates and modular gates
- scientific article; zbMATH DE number 2011859
- Lower bounds for modular counting by circuits with modular gates
- Lower bounds for modular counting by circuits with modular gates
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (16)
- Learning DNF from random walks
- On the computational power of depth-2 circuits with threshold and modulo gates
- Circuit complexity before the dawn of the new millennium
- On the correlation between parity and modular polynomials
- On the power of a threshold gate at the top
- On the power of small-depth threshold circuits
- A note on a theorem of Barrington, Straubing and Thérien
- The correlation between parity and quadratic polynomials mod \(3\)
- On realizing iterated multiplication by small depth threshold circuits
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Mathematical Foundations of Computer Science 2005
- Lower bounds for modular counting by circuits with modular gates
- MODp-tests, almost independence and small probability spaces
- Title not available (Why is that?)
- Languages defined with modular counting quantifiers
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
This page was built for publication: On the computational power of depth 2 circuits with threshold and modulo gates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817596)
