Cook, S. and, Urquhart, A. (1993) Functional interpretaions of feasibly constructive arithmetic, Annals of Pure and Applied Logic 63, 103--200. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A Tight Relationship between Generic Oracles and Type-2 .. - Cook, Impagliazzo.. (1997) Self-citation (Cook) (Correct)
....greatest common divisors, when the input polynomials are accessed only through queries. Another example is NP search problems, where the input is an exponentially large search space. Beame et al. [2] give a natural type 2 description of such problems. For a third example, Cook and Urquhart [7] show how to use higher type polynomial time functions to give constructive meaning to number theory theorems proved in a certain formal system. An oracle Turing machine (OTM) is a Turing machine that is able to make queries at unit cost to its oracle , representing a set or function. Such ....
Cook, S. and, Urquhart, A. (1993) Functional interpretaions of feasibly constructive arithmetic, Annals of Pure and Applied Logic 63, 103--200.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC