A geometric approach to threshold circuit complexity

Abstract

We introduce a geometric approach for investigating the power of threshold circuits. Viewing n- variable boolean functions as vectors in R 2 n , we invoke tools from linear algebra and linear programming to derive new results on the realizability of boolean functions using threshold gates.