Representing Boolean functions as polynomials modulo composite numbers-Reference-Cited by-同舟云学术

Representing Boolean functions as polynomials modulo composite numbers

Published:1994-12 Issue:4 Volume:4 Page:367-382
ISSN:1016-3328
Container-title:Computational Complexity
language:en
Short-container-title:Comput Complexity

Author:

Barrington David A. Mix,Beigel Richard,Rudich Steven

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01263424.pdf

Reference33 articles.

1. L. Babai and L. Fortnow, A characterization of #P by arithmetic straight-line programs. InProc. 31st Ann. IEEE Symp. Found. of Comput. Sci., 1990, 26?34.

2. L. Babai, N. Nisan, and M. Szegedy, Multiparty protocols and pseudorandom sequences. InProc. Twenty-first ACM Symp. Theor. Comput., 1989, 1?11.

3. Technical Report TM-291;D. A. Barrington,1985

4. Technical Report COINS TR 87-93;D. A. Barrington,1986

5. D. A. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages inNC 1.J. Comput. System Sci. 38 (1989), 150?164.

Cited by 62 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Note on the LogRank Conjecture in Communication Complexity;Mathematics;2023-11-15

2. Optimal Polynomial-time Compression for Boolean Max CSP;ACM Transactions on Computation Theory;2023-09-26

3. Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations;SIAM Journal on Computing;2022-05-19

4. Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification;Theoretical Computer Science;2021-09

5. Intermediate problems in modular circuits satisfiability;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08