On the computational power of boolean decision lists

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2285, Issue , 2002, Pages 372-383

  Krause, Matthias ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

Boolean complexity theory; Learnability; Lower bounds

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

BOOLEAN COMPLEXITY; COMPUTATIONAL POWER; CONJUNCTIVE NORMAL FORMS; EFFICIENT SIMULATION; LEARNABILITY; LOWER BOUNDS; NATURAL GENERALIZATION; POLYNOMIAL WEIGHT;

COMPUTER CIRCUITS;

EID: 84937430349     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_30     Document Type: Conference Paper

References (12)

1. N. Alon, J. Bruck. Explicite constructions of depth two majority circuits for comparison and addition. Techn. Report RJ 8300 (75661) IBM San Jose, 1991.
2. J. Aspnes, R. Beigel, M. Furst, S. Rudich. The expressive power of Voting Polynomials. Proc. STOC’91, 402-409.
3. J. Bruck. Harmonic Analysis of polynomial threshold functions. SIAM Journal of Discrete Mathematics. 3:22, 1990, pp. 168-177.
4. J. Bruck, R. Smolensky. Polynomial Threshold functions, AC0-functions, and spectral norms. Proc. of FOCS’90, 632-641.
5. M. Goldmann, J. Hǻstad, A.A. Razborov. Majority gates versus general weighted Threshold gates. J. Computational Complexity 2, 1992, 277-300.
6. J. Hǻstad. Almost optimal lower bounds for small depth circuits. STOC’86, pp. 6-20.
7. J. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution, FOCS’94, pp. 42-53.
8. M. Krause, P. Pudlak. On the computational power of depth-2 circuits with threshold and modulo gates. J. Theoretical Computer Science 174, 1997, pp. 137-156. Prel. version in STOC’94, pp. 49-59.
9. M. Krause, P. Pudlak. Computing Boolean functions by polynomials and threshold circuits. J. Comput. complex. 7 (1998), pp. 346-370. Prel. version in FOCS’95, pp. 682-691.
10. N. Linial, Y. Mansour, N. Nisan. Constant depth circuits, Fourier transform, and learnability. J. of the ACM, vol. 40(3), 1993, pp. 607-620. Prel. version in FOCS’89, pp. 574-579.
11. M. Minsky, S. Papert. Perceptrons. MIT Press, Cambridge 1988 (expanded edition, first edition 1968).
12. I. Wegener. Branching Programs and Binary Decision Diagrams. SIAM Monographs on Discrete Mathematics and Applications. Philadelphia 2000.