Majority gates vs. general weighted threshold gates
M. Goldmann, J. Hastad, Alexander Alexandrovich Razborov · 2003
Small-depth circuits that contain threshold gates (with or without weights) and parity gates are studied. All circuits considered are of polynomial size. Several results that complete the work of characterizing possible inclusions between many classes defined by small-depth circuits are proved.>