Polynomial Threshold Functions and Boolean Threshold Circuits

We initiate a comprehensive study of the complexity of computing Boolean functions by polynomial threshold functions (PTFs) on general Boolean domains. A typical example of a general Boolean domain is {1,2} n . We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being of secondary interest.