Theory of majority decision elements
From MaRDI portal
Publication:2539620
DOI10.1016/0016-0032(61)90702-5zbMath0196.51705OpenAlexW2061055380MaRDI QIDQ2539620
Iwao Toda, Saburo Muroga, 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
Related Items
Weights of exact threshold functions ⋮ Boolean minors ⋮ Approximate Degree in Classical and Quantum Computing ⋮ On PAC learning algorithms for rich Boolean function classes ⋮ General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results ⋮ A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting ⋮ Improved approximation of linear threshold functions ⋮ Unnamed Item ⋮ The inverse Shapley value problem ⋮ Neural networks and complexity theory ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ On the characterization of weighted simple games ⋮ Realization of threshold functions by generation of canonical weight vectors with a given sum ⋮ Unnamed Item ⋮ Sparse weighted voting classifier selection and its linear programming relaxations ⋮ Loading Deep Networks Is Hard: The Pyramidal Case ⋮ New algorithms and lower bounds for circuits with linear threshold gates ⋮ A Better Upper Bound on Weights of Exact Threshold Functions ⋮ The communication complexity of addition ⋮ Circular nonsingular threshold transformations ⋮ Computing with discrete multi-valued neurons ⋮ On the enumeration of bipartite simple games ⋮ Polynomial threshold functions and Boolean threshold circuits ⋮ Quantum matchgate computations and linear threshold gates ⋮ On the fixing group for a totally pre-ordered Boolean function ⋮ Unnamed Item ⋮ Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity ⋮ Algorithms and lower bounds for de morgan formulas of low-communication leaf gates ⋮ Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression ⋮ Unnamed Item ⋮ Majority Decision Functions of up to Six Variables ⋮ Cellular automata and discrete neural networks ⋮ Graphs of nonsingular threshold transformations
Cites Work
- Linear Inequalities and Related Systems. (AM-38)
- Automata Studies. (AM-34)
- Outline of an algorithm for integer solutions to linear programs
- Lattice Theoretic Properties of Frontal Switching Functions
- A logical calculus of the ideas immanent in nervous activity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Theory of majority decision elements
