Time and Space††This research was supported in part under N S F grant GJ 43634X, contract number DCR 7412997 A01.

This publication has 35 references indexed in Scilit:

• Fast Parallel Matrix Inversion Algorithms
  SIAM Journal on Computing, 1976
• A Combinatorial Problem Which Is Complete in Polynomial Space
  Journal of the ACM, 1976
• Alternation
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1976
• Quantifier elimination for real closed fields by cylindrical algebraic decompostion
  Published by Springer Nature ,1975
• An observation on time-storage trade off
  Journal of Computer and System Sciences, 1974
• Storage requirements for deterministic / polynomial time recognizable languages
  Published by Association for Computing Machinery (ACM) ,1974
• On Languages Accepted in Polynomial Time
  SIAM Journal on Computing, 1972
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
  Journal of the ACM, 1971
• The recognition problem for the set of perfect squares
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1966