论文信息 - Some Simplified Undecidable and NP-Hard Problems for Simple Programs - 字舞流文

Some Simplified Undecidable and NP-Hard Problems for Simple Programs

Eitan M. Gurari | Oscar H. Ibarra | O. Ibarra | E. Gurari

[1] Eitan M. Gurari,et al. The Complexity of the Equivalence Problem for Simple Programs , 1981, JACM.

[2] Samuel N. Kamin,et al. A Complete and Consistent Hoare Axiomatics for a Simple Programming Language , 1979, JACM.

[3] Neil D. Jones,et al. The Complexity of Finite Memory Programs with Recursion , 1978, JACM.

[4] E. Gurari. Counter machines, number-theoretic problems, presburger formulas and simple programs. , 1978 .

[5] Neil D. Jones,et al. Even simple programs are hard to analyze , 1977, POPL '75.

[6] Sartaj Sahni,et al. On the Computational Complexity of Scheme Equivalence , 1974 .

[7] Allan Borodin,et al. Subrecursive Programming Languages, Part I: efficiency and program structure , 1972, JACM.

[8] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[9] Dennis Tsichritzis,et al. The Equivalence Problem of Simple Programs , 1970, JACM.

[10] Marvin Minsky,et al. Computation : finite and infinite machines , 2016 .

[11] Dennis M. Ritchie,et al. The complexity of loop programs , 1967, ACM National Conference.