Pages that link to "Item:Q2514146"
From MaRDI portal
The following pages link to Polynomial threshold functions and Boolean threshold circuits (Q2514146):
Displaying 12 items.
- Asymptotics of the number of 2-threshold functions (Q2051779) (← links)
- A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
- A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
- Trading transforms of non-weighted simple games and integer weights of weighted simple games (Q2157830) (← links)
- Nearest neighbor representations of Boolean functions (Q2672259) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- (Q4612486) (← links)
- Weights of exact threshold functions (Q5033984) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
- (Q5144358) (← links)
- Differentiable learning of matricized DNFs and its application to Boolean networks (Q6134346) (← links)
