Pages that link to "Item:Q2539620"
From MaRDI portal
The following pages link to Theory of majority decision elements (Q2539620):
Displaying 26 items.
- Improved approximation of linear threshold functions (Q371200) (← links)
- Sparse weighted voting classifier selection and its linear programming relaxations (Q436579) (← links)
- The communication complexity of addition (Q519955) (← links)
- Cellular automata and discrete neural networks (Q807039) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- Circular nonsingular threshold transformations (Q1199492) (← links)
- Computing with discrete multi-valued neurons (Q1201886) (← links)
- On the fixing group for a totally pre-ordered Boolean function (Q1258718) (← links)
- Graphs of nonsingular threshold transformations (Q1322196) (← links)
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
- On the characterization of weighted simple games (Q1698978) (← links)
- Boolean minors (Q1894774) (← links)
- On the enumeration of bipartite simple games (Q2022519) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- The inverse Shapley value problem (Q2411521) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- A Better Upper Bound on Weights of Exact Threshold Functions (Q3010394) (← links)
- Quantum matchgate computations and linear threshold gates (Q3076715) (← links)
- Majority Decision Functions of up to Six Variables (Q3290167) (← links)
- (Q4612478) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- (Q5009542) (← links)
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- (Q5121894) (← links)
