论文信息 - A Note on the Relation Between Polynomial Time Functionals and Constable's Class K

A Note on the Relation Between Polynomial Time Functionals and Constable's Class K

A result claimed without proof by R. Constable in a STOC73 paper is here corrected: a strictly increasing function f is presented for which Constable's class K(f) is properly contained in FP(f), the collection of functions polynomial time computable in f.

Peter Clote

[1] P. Clote. Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k , NC k and NC , 1990 .

[2] Mike Townsend,et al. Complexity for Type-2 Relations , 1990, Notre Dame J. Formal Log..

[3] Burkhard Monien. A Recursive and a Grammatical Characterization of the Exponential-Time Languages , 1976, Theor. Comput. Sci..

[4] Peter Clote,et al. Computational Models and Function Algebras , 1994, LCC.

[5] Robert W. Ritchie,et al. CLASSES OF PREDICTABLY COMPUTABLE FUNCTIONS , 1963 .

[6] Bruce M. Kapron,et al. Parallel computable higher type functionals , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[7] Bill Allen,et al. Arithmetizing Uniform NC , 1991, Ann. Pure Appl. Log..

[8] P. Clote,et al. First Order Bounded Arithmetic and Small Boolean Circuit Complexity Classes , 1995 .

[9] Kurt Mehlhorn,et al. Polynomial and abstract subrecursive classes , 1974, STOC '74.

[10] Klaus W. Wagner. Bounded Recursion and Complexity Classes , 1979, MFCS.

[11] Yehoshua Bar-Hillel,et al. The Intrinsic Computational Difficulty of Functions , 1969 .

[12] Robert L. Constable,et al. Type two computational complexity , 1973, STOC.

[13] Neil Immerman,et al. On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[14] Peter Clote. Boolean functions, invariance groups and parallel complexity , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.