An arithmetic model of computation equivalent to threshold circuits

Theoretical Computer Science - Tập 93 - Trang 303-319 - 1992
Joan Boyar1
1University of Chicago, 1100 E 58th St., Chicago, Illinois 60637, USA

Tài liệu tham khảo

Beame, 1986, Log depth circuits for division and related problems, SIAM J. Comput., 15, 994, 10.1137/0215070

Bøgestrand, 1988, Computations in finite fields

Chandra, 1984, Constant depth reducibility, SIAM J. Comput., 13, 423, 10.1137/0213028

Hajnal, 1987, Threshold circuits of bounded depth, 99

Hungerford, 1974

Lidl, 1983, Finite Fields, 20

Muroga, 1971

Papadimitriou, 1982

Razborov, 1987, Lower bounds on the size of bounded depth circuits over a complete basis with logical addition, Math. Notes, 41, 333, 10.1007/BF01137685