Monotone circuits for monotone weighted threshold functions

Information Processing Letters

Volumn 97, Issue 1, 2006, Pages 12-18

  Beimel, Amos ^a   Weinreb, Enav ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Computational complexity; Cryptography; Parallel algorithms; Theory of computation

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; FUNCTIONS; PARALLEL ALGORITHMS; POLYNOMIALS;

MONOTONE CIRCUITS; SECRET SHARING; THRESHOLD FUNCTIONS;

CIRCUIT THEORY;

EID: 27844491900     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.09.008     Document Type: Article

References (22)

1. M. Ajtai, J. Koml'os, E. Szemerédi, An O (n log n ) sorting network, in: Proc 15 STOC, 1983, pp. 1-9
2. K. Amano, A. Maruoka, Better simulation of exponential threshold weights by polynomial weights, Technical Report TR04-090, Electronic Colloquium on Computational Complexity, 2005
3. A. Beimel, T. Tassa, and E. Weinreb Characterizing ideal weighted threshold secret sharing Proc. Second Theory of Cryptography Conf. Lecture Notes in Comput. Sci. vol. 3378 2005 Springer Berlin 600 619
4. J. Benaloh, and J. Leichter Generalized secret sharing and monotone functions CRYPTO'88 Lecture Notes in Comput. Sci. vol. 403 1990 Springer Berlin 27 35
5. M. Goldmann, J. Håstad, and A.A. Razborov Majority gates vs. general weighted threshold gates Comput. Complexity 2 1992 277 300
6. M. Goldmann, and M. Karpinski Simulating threshold circuits by majority circuits SIAM J. Comput. 27 1998 230 246
7. J. Håstad On the size of weights for threshold gates SIAM J. Discrete Math. 7 3 1994 484 492
8. N. Littlestone Learning when irrelevant attributes abound: A new linear-threshold algorithm Mach. Learning 2 1988 285 318
9. M.L. Minsky, and S.A. Papert Perceptrons 1968 MIT Press Cambridge, MA (Expanded edition, 1988)
10. P. Morillo, C. Padró, G. Sáez, and J.L. Villar Weighted threshold secret sharing schemes Inform. Process. Lett. 70 5 1999 211 216
11. S. Muroga Threshold Logic and its Applications 1971 Wiley-Intercience New York
12. Y. Ofman On the algorithmic complexity of discrete functions Sov. Phys. Dokl. 7 1963 589 591 (English translation)
13. I. Parberry, and G. Schnitger Parallel computation with threshold functions J. Comput. System Sci. 36 3 1988 278 302
14. G. Sáez, Some results on the dual of weighted threshold access structures, Manuscript, 2004
15. R. Servedio Monotone Boolean formulas can approximate monotone linear threshold functions Discrete Appl. Math. 142 1-3 2004 181 187
16. A. Shamir How to share a secret Comm. ACM 22 1979 612 613
17. P.M. Spira, On time hardware tradeoffs for Boolean functions, in: Proc. 4th Hawaii Symp. on System Sci., 1971, pp. 525-527
18. L.G. Valiant Short monotone formulae for the majority function J. Algorithms 5 3 1984 363 366
19. V. Vinod, A. Narayanan, K. Srinathan, C. Pandu Rangan, and K. Kim On the power of computational secret sharing Proc. Indocrypt Lecture Notes in Comput. Sci. vol. 2904 2003 162 176
20. C.S. Wallace A suggestion for a fast multiplier IEEE Trans. Comput. 13 1964 14 17
21. I. Wegener Relating monotone formula size and monotone depth of Boolean functions Inform. Process. Lett. 16 1 1983 41 42
22. A.C. Yao, Unpublished manuscript, 1989. Presented at Oberwolfach and DIMACS workshops