Theory of majority decision elements
From MaRDI portal
Publication:2539620
DOI10.1016/0016-0032(61)90702-5zbMATH Open0196.51705OpenAlexW2061055380MaRDI QIDQ2539620FDOQ2539620
Authors: Saburo Muroga, Iwao Toda, Satoru Takasu 
Publication date: 1961
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0016-0032(61)90702-5
Cites Work
- Linear Inequalities and Related Systems. (AM-38)
- Outline of an algorithm for integer solutions to linear programs
- A logical calculus of the ideas immanent in nervous activity
- Title not available (Why is that?)
- Lattice Theoretic Properties of Frontal Switching Functions
- Title not available (Why is that?)
- Automata Studies. (AM-34)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (31)
- On the enumeration of bipartite simple games
- On the fixing group for a totally pre-ordered Boolean function
- Sparse weighted voting classifier selection and its linear programming relaxations
- On the characterization of weighted simple games
- Title not available (Why is that?)
- Algorithms and lower bounds for De Morgan formulas of low-communication leaf gates
- Majority Decision Functions of up to Six Variables
- Boolean minors
- Loading Deep Networks Is Hard: The Pyramidal Case
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting
- A better upper bound on weights of exact threshold functions
- Title not available (Why is that?)
- Small extended formulation for knapsack cover inequalities from monotone circuits
- On PAC learning algorithms for rich Boolean function classes
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity
- Polynomial threshold functions and Boolean threshold circuits
- Circular nonsingular threshold transformations
- Computing with discrete multi-valued neurons
- Approximate Degree in Classical and Quantum Computing
- Graphs of nonsingular threshold transformations
- Improved approximation of linear threshold functions
- Quantum matchgate computations and linear threshold gates
- Cellular automata and discrete neural networks
- Realization of threshold functions by generation of canonical weight vectors with a given sum
- Neural networks and complexity theory
- Weights of exact threshold functions
- The communication complexity of addition
- Forms of representation for simple games: sizes, conversions and equivalences
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression
- Satisfiability and derandomization for small polynomial threshold circuits
This page was built for publication: Theory of majority decision elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2539620)
