论文信息 - The Separation of Relativized Versions of P and DNP for the Ring of the Reals

The Separation of Relativized Versions of P and DNP for the Ring of the Reals

We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form x ≥ 0. The oracle machines can also check whether a tuple of real numbers belongs to a given oracle set or not. We present oracle sets containing positive integers and pairs of numbers, respectively, such that the classes P and DNP relative to these oracles are not equal. The first set is constructed by diagonalization techniques and the second one is derived from the Knapsack Problem.

Christine Gaßner | C. Gaßner

[1] Christine Gaßner,et al. Relativizations of the P =? DNP Question for the BSS Model , 2009, CCA.

[2] Klaus Meer. A note on a P NP result for a restricted class of real machines , 1992, J. Complex..

[3] T. Emerson,et al. Relativizations of the P=?NP Question over the Reals (and other Ordered Rings) , 1994, Theor. Comput. Sci..

[4] Christine Gaßner. Oracles and Relativizations of the P =? NP Question for Several Structures , 2009, J. Univers. Comput. Sci..

[5] Peter Bürgisser,et al. On the Structure of Valiant's Complexity Classes , 1998, Discret. Math. Theor. Comput. Sci..

[6] S. Smale,et al. On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[7] Louise Larose. Les petits cailloux , 1998 .

[8] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[9] Pascal Koiran. Computing over the Reals with Addition and Order , 1994, Theor. Comput. Sci..

[10] Pascal Koiran. A weak version of the Blum, Shub and Smale model , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[11] John Gill,et al. Relativizations of the P =? NP Question , 1975, SIAM J. Comput..