메뉴 건너뛰기




Volumn 30, Issue 1, 1983, Pages 217-228

Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs

Author keywords

characteristic of a field; eqmvalence problem; infinite field; NP hard; Stralght line program

Indexed keywords


EID: 84976819141     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322358.322373     Document Type: Article
Times cited : (74)

References (19)
  • 10
    • 84976780658 scopus 로고
    • On the simplification and equivalence problems for straight-line programs To appear in J. ACM (available as Tech. Rep. 79-21, Computer Science Dep., Univ. of Minnesota, Minneapolis, Minn.
    • Ibarra, O, akd Letninger, B. On the simplification and equivalence problems for straight-line programs To appear in J. ACM (available as Tech. Rep. 79-21, Computer Science Dep., Univ. of Minnesota, Minneapolis, Minn., 1979).
    • (1979)
    • Ibarra, O.1    akd Letninger, B.2
  • 12
    • 0003657590 scopus 로고
    • Seminumericat Algorithms. Addison-Wesley, Reading, Mass.
    • Knuth, D. The Art of Computer Programming, Vol. 2. Seminumericat Algorithms. Addison-Wesley, Reading, Mass., 1969.
    • (1969) The Art of Computer Programming , vol.2
    • Knuth, D.1
  • 15
    • 84976665368 scopus 로고
    • On the accepting density hierarchy in NP (submitted for publication) A more complete version is available as Tech. Rep. 79-29, Computer Science Dep., Univ. of Minnesota, Minneapolis, Minn
    • Moran, S. On the accepting density hierarchy in NP (submitted for publication) A more complete version is available as Tech. Rep. 79-29, Computer Science Dep., Univ. of Minnesota, Minneapolis, Minn, 1979.
    • (1979)
    • Moran, S.1
  • 17
    • 85034715651 scopus 로고
    • Proc. 11th Ann ACM Symp on Theory of Computing, Atlanta, Ga.
    • Valiant, L. Completeness classes m algebra. Proc. 11th Ann ACM Symp on Theory of Computing, Atlanta, Ga., 1979, pp. 249-261
    • (1979) Completeness classes m algebra. , pp. 249-261
    • Valiant, L.1
  • 18
    • 85040154387 scopus 로고
    • Proc. 20th Ann. IEEE Symp on Foundations of Computer Science, San Juan, Puerto Rico
    • Yemini, Y. Some theoretical aspects of position-location problems. Proc. 20th Ann. IEEE Symp on Foundations of Computer Science, San Juan, Puerto Rico, 1979, pp. 1-8.
    • (1979) Some theoretical aspects of position-location problems. , pp. 1-8
    • Yemini, Y.1


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