The following pages link to (Q4835643):
Displaying 14 items.
- Quadratization of symmetric pseudo-Boolean functions (Q260013) (← links)
- Sign-representation of Boolean functions using a small number of monomials (Q280399) (← links)
- Improved approximation of linear threshold functions (Q371200) (← links)
- Energy and depth of threshold circuits (Q410715) (← links)
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions (Q627177) (← links)
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021) (← links)
- On the characterization of weighted simple games (Q1698978) (← links)
- Spiking neurons and the induction of finite state machines. (Q1853470) (← links)
- On the enumeration of Boolean functions with distinguished variables (Q2100402) (← links)
- Combined weight and density bounds on the polynomial threshold function representation of Boolean functions (Q2142651) (← links)
- Size and Energy of Threshold Circuits Computing Mod Functions (Q3182969) (← links)
- Computing with Spikes: The Advantage of Fine-Grained Timing (Q5157248) (← links)
- Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions (Q5380309) (← links)
- Size, Depth and Energy of Threshold Circuits Computing Parity Function. (Q6065463) (← links)
