Apr 12, 2012 · The \emph{weight} of a threshold gate is the sum of its absolute values. In this paper we study how large a weight might be needed if we fix ...

In this paper we study how large weight might be needed if we fix some function and some threshold degree. We prove 2^{\Omega(2^{2n/5})} lower bound on this ...

In this paper we study how large a weight might be needed if we fix some function and some threshold degree. We prove 2Ω(22n/ ...

Jun 28, 2013 · An integer polynomial p of n variables is called a threshold gate for a Boolean function f of n variables if for all x ∈ {0, 1}n f(x) = 1 if and ...

This proof is conceptually similar to other proofs of the bounds on weights of nonlinear threshold gates, but avoids a lot of technical details arising in ...

A 5n− o (n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function.Alexander S. Kulikov, Olga Melanich & Ivan Mihajlin - 2012 - In S. Barry ...

Lower bound on weights of large degree threshold functions V. V. Podolskii · Steklov Mathematical Institute, Gubkina str. 8, 119991, Moscow, Russia · Citations ...

An integer polynomial p of n variables is called a threshold gate for a Boolean function f of n variables if for all x∈{0,1}n f(x)=1 if and only if p(x) ...

Bibliographic details on Lower Bound on Weights of Large Degree Threshold Functions.

Feb 22, 2011 · In decision tree complexity of a boolean function, a very well know lower bound method is to find a (approximate) polynomial that represents the function.