Author:
Beimel Amos,G�l Anna,Paterson Mike
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference39 articles.
1. N. Alon andR. B. Boppana, The monotone circuit complexity of Boolean functions.Combinatorica 7 (1) (1987), 1?22.
2. L. Babai, A. Gál, J. Kollár, L. Rónyai, T. Szabó, and A. Wigderson, Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs. InProc. Twenty-eight Ann. ACM Symp. Theor. Comput., 1996. To appear.
3. A. Beimel, Ideal secret sharing schemes. Master's thesis, Technion-Israel Institute of Technology, Haifa, 1992. (In Hebrew, Abstract in English).
4. A. Beimel andB. Chor, Universally ideal secret sharing schemes.IEEE Trans. Inform. Theory 40 (3) (1994), 786?794.
5. A. Beimel, A. Gál, and M. Paterson, Lower bounds for monotone span programs. Research Series BRICS-RS-94-46, BRICS, Department of Computer Science, University of Aarhus, 1994.
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献