Does truth-table of linear norm reduce the one-query tautologies to a random oracle?

In our former works, for a given concept of reduction, we study the following hypothesis: “For a random oracle A, with probability one, the degree of the one-query tautologies with respect to A is strictly higher than the degree of A.” In our former works (Suzuki in Kobe J. Math. 15, 91–102, 1998; in Inf. Comput. 176, 66–87, 2002; in Arch. Math. Logic 44, 751–762), the following three results are shown: The hypothesis for p-T (polynomial-time Turing) reduction is equivalent to the assertion that the probabilistic complexity class R is not equal to NP; The hypothesis for p-tt (polynomial-time truth-table) reduction implies that P is not NP; The hypothesis holds for each of the following: disjunctive reduction, conjunctive reduction, and p-btt (polynomial-time bounded-truth-table) reduction. In this paper, we show the following three results: (1) Let c be a positive real number. We consider a concept of truth-table reduction whose norm is at most c times size of input, where for a relativized propositional formula F, the size of F denotes the total number of occurrences of propositional variables, constants and propositional connectives. Then, our main result is that the hypothesis holds for such tt-reduction, provided that c is small enough. How small c can we take so that the above holds? It depends on our syntactic convention on one-query tautologies. In our setting, the statement holds for all c < 1. (2) The hypothesis holds for monotone truth-table reduction (also called positive reduction). (3) Dowd (in Inf. Comput. 96, 65–76, 1992) shows a polynomial upper bound for the minimum sizes of forcing conditions associated with a random oracle. We apply the above result (1), and get a linear lower bound for the sizes.

[1]  Sebastiaan Terwijn,et al.  Genericity and Measure for Exponential Time , 1994, Theor. Comput. Sci..

[2]  G. Sacks.  Degrees of unsolvability , 1965 .

[3]  Toshio Suzuki,et al.  Recognizing tautology by a deterministic algorithm whose while-loop's execution time is bounded by forcing , 1998 .

[4]  André Nies,et al.  Calibrating Randomness , 2006, Bull. Symb. Log..

[5]  A. Selman.  Structure in Complexity Theory , 1986, Lecture Notes in Computer Science.

[6]  Suzuki Toshio,et al.  Computational complexity of Boolean formulas with query symbols , 1999 .

[7]  Klaus Ambos-Spies,et al.  Diagonalizations over Polynomial Time Computable Sets , 1987, Theor. Comput. Sci..

[8]  Emil L. Post.  Recursively enumerable sets of positive integers and their decision problems , 1944 .

[9]  Shouwen Tang,et al.  Polynomial-Time Reducibilities and "Almost All" Oracle Sets , 1991, Theor. Comput. Sci..

[10]  José L. Balcázar,et al.  Structural Complexity I , 1988, EATCS Monographs on Theoretical Computer Science Series.

[11]  C. Jockusch.  Reducibilities in recursive function theory. , 1966 .

[12]  Martin Dowd,et al.  Generic Oracles, Uniform Machines, and Codes , 1992, Inf. Comput..

[13]  Toshio Suzuki,et al.  Complexity of the r-query Tautologies in the Presence of a Generic Oracle , 2000, Notre Dame J. Formal Log..

[14]  Manuel Lerman,et al.  Degrees of Unsolvability: Local and Global Theory , 1983 .

[15]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[16]  Klaus Ambos-Spies,et al.  Randomness, Relativizations, and Polynomial Reducibilities , 1986, SCT.

[17]  Eric Allender,et al.  What can be efficiently reduced to the Kolmogorov-random strings? , 2006, Ann. Pure Appl. Log..

[18]  Ker-I Ko,et al.  Some Observations on the Probabilistic Algorithms and NP-hard Problems , 1982, Inf. Process. Lett..

[19]  Toshio Suzuki,et al.  Forcing Complexity: Minimum Sizes of Forcing Conditions , 2001, Notre Dame J. Formal Log..

[20]  A. Sorbi.  complexity, logic, and recursion theory , 1997 .

[21]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[22]  R.E. Ladner,et al.  A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[23]  Toshio Suzuki,et al.  Bounded truth table does not reduce the one-query tautologies to a random oracle , 2005, Arch. Math. Log..

[24]  Toshio Suzuki,et al.  Degrees of Dowd-Type Generic Oracles , 2002, Inf. Comput..