메뉴 건너뛰기
Computational Complexity
Volumn 14, Issue 1, 2005, Pages 1-19
Deterministic polynomial identity testing in non-commutative models
Author keywords

Arithmetic branching programs; Non commutative formulas; Polynomial identity testing
Indexed keywords

EID: 18244365341     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-005-0188-8     Document Type: Article
Times cited : (128)
References (10)
  • 2
    • 15244352005 scopus 로고    scopus 로고
    • Derandomizing polynomial identity tests means proving circuit lower bounds
    • R. IMPAGLIAZZO & V. KABANETS (2004). Derandomizing polynomial identity tests means proving circuit lower bounds. Comput. Complexity 13, 1-46.
    • (2004) Comput. Complexity , vol.13 , pp. 1-46
    • Impagliazzo, R.1    Kabanets, V.2
  • 3
    • 85000547940 scopus 로고
    • Lower bounds for non-commutative computation
    • B. Awerbuch (ed.), (New Orleans, LS), ACM Press
    • N. NISAN (1991). Lower bounds for non-commutative computation. In B. Awerbuch (ed.), Proc. 23rd Annual ACM Symposium on the Theory of Computing (New Orleans, LS), ACM Press, 410-418.
    • (1991) Proc. 23rd Annual ACM Symposium on the Theory of Computing , pp. 410-418
    • Nisan, N.1
  • 4
    • 0039648502 scopus 로고    scopus 로고
    • Lower bound on arithmetic circuits via partial derivatives
    • N. NISAN & A. WIGDERSON (1996). Lower bound on arithmetic circuits via partial derivatives. Comput. Complexity 6, 217-234.
    • (1996) Comput. Complexity , vol.6 , pp. 217-234
    • Nisan, N.1    Wigderson, A.2
  • 5
    • 4544258177 scopus 로고    scopus 로고
    • Multi-linear formulas for permanent and determinant are of superpolynomial size
    • Chicago, IL
    • R. RAZ (2004a). Multi-linear formulas for permanent and determinant are of superpolynomial size. In Proc. 36th Annual ACM Symposium on Theory of Computing (Chicago, IL), 633-641.
    • (2004) Proc. 36th Annual ACM Symposium on Theory of Computing , pp. 633-641
    • Raz, R.1
  • 7
    • 84976779342 scopus 로고
    • Fast probabilistic algorithms for verification of polynomial identities
    • J. T. SCHWARTZ (1980). Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 701-717.
    • (1980) J. ACM , vol.27 , pp. 701-717
    • Schwartz, J.T.1
  • 8
    • 0035729224 scopus 로고    scopus 로고
    • Depth-3 arithmetic circuits over fields of characteristic zero
    • A. SHPILKA & A. WIGDERSON (2001). Depth-3 arithmetic circuits over fields of characteristic zero. Comput. Complexity 10, 1-27.
    • (2001) Comput. Complexity , vol.10 , pp. 1-27
    • Shpilka, A.1    Wigderson, A.2
  • 9
    • 84949635003 scopus 로고    scopus 로고
    • On the descriptive and algorithmic power of parity ordered binary decision diagrams
    • Lecture Notes in Comput. Sci. 1200, Springer
    • S. WAACK (1997). On the descriptive and algorithmic power of parity ordered binary decision diagrams. In Proc. 14th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1200, Springer, 201-212.
    • (1997) Proc. 14th Symposium on Theoretical Aspects of Computer Science , pp. 201-212
    • Waack, S.1
  • 10
    • 84925463455 scopus 로고
    • Probabilistic algorithms for sparse polynomials
    • (EUROSAM '79, Marseille), Springer, Berlin
    • R. ZIPPEL (1979). Probabilistic algorithms for sparse polynomials. In Symbolic and Algebraic Computation (EUROSAM '79, Marseille), Springer, Berlin, 216-226.
    • (1979) Symbolic and Algebraic Computation , pp. 216-226
    • Zippel, R.1

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