메뉴 건너뛰기




Volumn 69, Issue 1, 2004, Pages 28-44

The correlation between parity and quadratic polynomials mod 3

Author keywords

Circuit complexity; Computational complexity; Lower bounds

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; CORRELATION METHODS; MODAL ANALYSIS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING; THRESHOLD LOGIC;

EID: 2942704331     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.01.003     Document Type: Conference Paper
Times cited : (15)

References (28)
  • 3
    • 0026940019 scopus 로고
    • Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
    • Babai L., Nisan N., Szegedy M. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. J. Comput. System Sci. 45(2):1992;204-232.
    • (1992) J. Comput. System Sci. , vol.45 , Issue.2 , pp. 204-232
    • Babai, L.1    Nisan, N.2    Szegedy, M.3
  • 5
    • 0009631578 scopus 로고
    • Complex polynomials and circuit lower bounds for modular counting
    • Barrington D.M., Straubing H. Complex polynomials and circuit lower bounds for modular counting. Comput. Complexity. 4:1994;325-338.
    • (1994) Comput. Complexity , vol.4 , pp. 325-338
    • Barrington, D.M.1    Straubing, H.2
  • 6
    • 0009553114 scopus 로고    scopus 로고
    • Upper and lower bounds for some depth-3 circuit classes
    • IEEE Computer Society Press, Silver Spring, MD
    • R. Beigel, A. Maciel, Upper and lower bounds for some depth-3 circuit classes, in: Proceedings of the 12th IEEE Conference on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 1997, pp. 149-157.
    • (1997) Proceedings of the 12th IEEE Conference on Computational Complexity , pp. 149-157
    • Beigel, R.1    Maciel, A.2
  • 8
    • 0024606088 scopus 로고
    • With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
    • Cai J.-Y. With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy. J. Comput. System Sci. 38:1989;68-85.
    • (1989) J. Comput. System Sci. , vol.38 , pp. 68-85
    • Cai, J.-Y.1
  • 10
    • 0002127588 scopus 로고
    • Parity, circuits, and the polynomial-time hierarchy
    • Furst M., Saxe J.B., Sipser M. Parity, circuits, and the polynomial-time hierarchy. Math. Systems Theory. 17:1984;13-27.
    • (1984) Math. Systems Theory , vol.17 , pp. 13-27
    • Furst, M.1    Saxe, J.B.2    Sipser, M.3
  • 11
    • 0000632542 scopus 로고
    • A note on the power of majority gates and modular gates
    • Goldmann M. A note on the power of majority gates and modular gates. Inform. Process. Lett. 53:1995;321-327.
    • (1995) Inform. Process. Lett. , vol.53 , pp. 321-327
    • Goldmann, M.1
  • 12
    • 0033417012 scopus 로고    scopus 로고
    • Exponential sums and circuits with a single threshold gate and mod-gates
    • Green F. Exponential sums and circuits with a single threshold gate and mod-gates. Theory Comput. Systems. 32:1999;453-466.
    • (1999) Theory Comput. Systems , vol.32 , pp. 453-466
    • Green, F.1
  • 13
    • 0034368817 scopus 로고    scopus 로고
    • A complex-number fourier method for lower bounds on the Mod-m degree
    • Green F. A complex-number fourier method for lower bounds on the Mod-m degree. Comput. Complexity. 9:2000;16-38.
    • (2000) Comput. Complexity , vol.9 , pp. 16-38
    • Green, F.1
  • 18
    • 0001295178 scopus 로고
    • On the power of small-depth threshold circuits
    • Håstad J., Goldmann M. On the power of small-depth threshold circuits. Comput. Complexity. 1:1991;113-129.
    • (1991) Comput. Complexity , vol.1 , pp. 113-129
    • Håstad, J.1    Goldmann, M.2
  • 21
    • 0000883554 scopus 로고
    • Lower bounds on the size of bounded depth networks over a complete basis with logical addition
    • Razborov A.A. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Mat. Zametki. 41:1987;598-607. (English translation in Math. Notes Acad. Sci. USSR 41 (1987) 333-338).
    • (1987) Mat. Zametki , vol.41 , pp. 598-607
    • Razborov, A.A.1
  • 22
    • 26944478724 scopus 로고
    • English translation
    • Razborov A.A. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Mat. Zametki. 41:1987;598-607. (English translation in Math. Notes Acad. Sci. USSR 41 (1987) 333-338).
    • (1987) Math. Notes Acad. Sci. USSR , vol.41 , pp. 333-338
  • 24
    • 0003215121 scopus 로고
    • Equations over finite fields: An elementary approach
    • New York: Springer
    • Schmidt W.M. Equations Over Finite Fields: an Elementary Approach. Lecture Notes in Mathematics. Vol. 536:1976;Springer, New York.
    • (1976) Lecture Notes in Mathematics , vol.536
    • Schmidt, W.M.1
  • 26
    • 0026239342 scopus 로고
    • PP is as hard as the polynomial-time hierarchy
    • Toda S. PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20:1991;865-877.
    • (1991) SIAM J. Comput. , vol.20 , pp. 865-877
    • Toda, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.