B. Kapron. Feasibly continuous type-two functionals. computational complexity, (8):188--201, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Resource-bounded Continuity and Sequentiality for Type-two.. - Exte Nd Ed (Correct)
....4. An efficient simulation The result presented in this section is a generalization of Blum s trick , 2] 6] 21] which relates certificate size and decision tree complexity for Boolean functions, to the case of the type two functionals considered here. A similar proof is given in [8], but for a special case which is described in detail below. We begin with the following simple fact about certificates. The following simple fact about certificates will prove essential in obtaining decision tree algorithms for functions with bounded certificates: Lemma 4.1 Suppose that c y is ....
....again will give a g s 1 which produces and answer. Finally, we can see that at each stage of the construction the length of the dialogue is extended by at most s (since each certificate has size bounded by s. So the overall length of the dialogue between f and g x;s is bounded by s In [8], Kapron presents a class of functionals which are feasibly continuous. Such functionals have certificates whose size is feasible, or polynomial, in terms of the size of the inputs f and x. Of course, it is not entirely clear what it means to be polynomial in the size of a function f . One ....
[Article contains additional citation context not shown here]
B. Kapron. Feasibly continuous type-two functionals. computational complexity, (8):188--201, 1999.
Resource-bounded Continuity and Sequentiality for Type-two.. - Buss, al. (Correct)
....4. An efficient simulation The result presented in this section is a generalization of Blum s trick , 2] 6] 21] which relates certificate size and decision tree complexity for Boolean functions, to the case of the type two functionals considered here. A similar proof is given in [8], but for a special case which is described in detail below. We begin with the following simple fact about certificates. The following simple fact about certificates will prove essential in obtaining decision tree algorithms for functions with bounded certificates: Lemma 4.1 Suppose that c y is ....
....again will give a g s 1 which produces and answer. Finally, we can see that at each stage of the construction the length of the dialogue is extended by at most s (since each certificate has size bounded by s. So the overall length of the dialogue between f and g x;s is bounded by s 2 . Xi In [8], Kapron presents a class of functionals which are feasibly continuous. Such functionals have certificates whose size is feasible, or polynomial, in terms of the size of the inputs f and x. Of course, it is not entirely clear what it means to be polynomial in the size of a function f . One ....
[Article contains additional citation context not shown here]
B. Kapron. Feasibly continuous type-two functionals. computational complexity, (8):188--201, 1999.
Resource-bounded Continuity and Sequentiality for Type-two.. - Exte Nd Ed (Correct)
No context found.
B. Kapron. Feasibly continuous type-two functionals. computational complexity, (8):188--201, 1999.
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