A new recursion-theoretic characterization of the polytime functions

This publication has 15 references indexed in Scilit:

• A new recursion-theoretic characterization of the polytime functions (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1992
• Computability and Complexity of Higher Type Functions
  Published by Springer Nature ,1992
• Arithmetizing Uniform NC
  Annals of Pure and Applied Logic, 1991
• Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k , NC k and NC
  Published by Springer Nature ,1990
• Languages that Capture Complexity Classes
  SIAM Journal on Computing, 1987
• Predicative Arithmetic. (MN-32)
  Published by Walter de Gruyter GmbH ,1986
• Exponential time and bounded arithmetic
  Published by Springer Nature ,1986
• Algebras of feasible functions
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Feasibly constructive proofs and the propositional calculus (Preliminary Version)
  Published by Association for Computing Machinery (ACM) ,1975
• Classes of predictably computable functions
  Transactions of the American Mathematical Society, 1963