On the Structure of Feasible Computation

During the last four years research on the lower level computational complexity has yielded a rich set of interesting results which have revealed deep and unexpected connections between various problems and thus brought new unity to this area of computer science. This work has also yielded new techniques and insights which are likely to have further applications, and it has identified some very central problems in the quantitative theory of computing. The purpose of this paper is to give the reader an overview of these developments, an insight into some of these results and applications, as well as an appreciation of the unity and structure which has emerged in this area of research.

[1]  Harry B. Hunt,et al.  On the complexity of grammar and related problems , 1975, STOC.

[2]  S.-Y. Kuroda,et al.  Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

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

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

[5]  Juris Hartmanis,et al.  On the Recognition of Primes by Automata , 1968, JACM.

[6]  Harry B. Hunt,et al.  The LBA Problem and its Importance in the Theory of Computing , 1973 .

[7]  Albert R. Meyer,et al.  WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE , 1973 .

[8]  Marvin Minsky,et al.  Form and Content in Computer Science (1970 ACM turing lecture) , 1970, JACM.

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

[10]  Richard Edwin Stearns,et al.  Hierarchies of memory limited computations , 1965, SWCT.

[11]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[12]  José Lucas Rangel.  The Equivalence Problem for Regular Expressions over one Letter Is Elementary , 1974, SWAT.

[13]  Robert E. Tarjan,et al.  A combinatorial problem which is complete in polynomial space , 1975, STOC.

[14]  E. F. Moore.  Sequential Machines: Selected Papers , 1964 .

[15]  Stephen A. Cook,et al.  Linear Time Simulation of Deterministic Two-Way Pushdown Automata , 1971, IFIP Congress.

[16]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[17]  Juris Hartmanis,et al.  An Overview of the Theory of Computational Complexity , 1971, JACM.

[18]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

[19]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[20]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[21]  Peter S. Landweber,et al.  Three Theorems on Phrase Structure Grammars of Type 1 , 1963, Inf. Control..

[22]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[23]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[24]  Sheila A. Greibach,et al.  The Hardest Context-Free Language , 1973, SIAM J. Comput..

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

[26]  Benoit B. Mandelbrot,et al.  Book review(from a series of mathematics texts under the general editorship of C. B. Allendoerfer) Introduction to Mathematical Statistics, Robert V. Hogg, Allen B. Craig, x + 245 pp., $6.75 , Macmillan, New York (1959) , 1960 .

[27]  Ronald V. Book,et al.  Comparing Complexity Classes , 1974, J. Comput. Syst. Sci..

[28]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.