论文信息 - A characterization of the class of functions computable in polynomial time on Random Access Machines

A characterization of the class of functions computable in polynomial time on Random Access Machines

Enumeration problems constitute a major part of combinatorial mathematics. Combinatorial mathematics expresses the solution of enumeration problems by means of solving formulas, generally based on the usual arithmetic operations [7]. These solving formulas can be formally represented as programs for a Random Access Machine (RAM) with arithmetical primitives, for which the natural complexity measure is the arithmetical complexity [1].

[1] Janos Simon. On some central problems in computational complexity , 1975 .

[2] Janos Simon,et al. On the Difference Between One and Many (Preliminary Version) , 1977, ICALP.

[3] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[4] Giancarlo Mauri,et al. On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems , 1981, Inf. Process. Lett..

[5] Allan Borodin,et al. The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[6] Arnold Schönhage,et al. On the Power of Random Access Machines , 1979, ICALP.

[7] Larry J. Stockmeyer,et al. A characterization of the power of vector machines , 1974, STOC '74.

[8] Janos Simon. Division is good , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[9] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[10] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

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

[12] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[13] Juris Hartmanis,et al. On the Power of Multiplication in Random Access Machines , 1974, SWAT.