J. Tor'an, "Structural Properties of the Counting Hierarchy", Ph.D. thesis, Facultat d'Informatica de Barcelona, 1988. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
On the Power of Deterministic Reductions to .. - Green (1991) (1 citation) (Correct)
....whether k 1 questions to NP cannot be answered by k questions to C= P. In fact we find that in some relativized world, there are sets that are recognizable with k 1 queries to NP that cannot be recognized with k queries to C= P. One may regard this as a generalization of the result of Tor an [21] that relative to some oracle, NP is not contained in C= P. In order to do this we again adapt the technique of [12] section 4) to appropriate circuit problems. In section 6 an oracle is constructed which separates every level of the Boolean hierarchy over NP from a level of the Boolean hierarchy ....
J. Tor'an, "Structural Properties of the Counting Hierarchy", Ph.D. thesis, Facultat d'Informatica de Barcelona, 1988.
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