Lower Bound on Weights of Large Degree Threshold Functions
An integer polynomial $p$ of $n$ variables is called a \emph{threshold gate} for a Boolean function $f$ of $n$ variables if for all $x \in \zoon$ $f(x)=1$ if and only if $p(x)\geq 0$. The \emph{weight} of a threshold gate is the sum of its absolute values. In this paper we study how large a weight...
| Published in: | Logical Methods in Computer Science |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2013-06-01
|
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/722/pdf |