Relativizations of the P =? DNP Question for the BSS Model

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 O or not. We construct oracles such that the classes P and DNP relative to these oracles are equal or not equal.

• Type: Conference
• Year: 2009
• Where: CCA
• Authors: Christine Gaßner
• Keywords: CCA 2009, Oracle Machines, Oracles, Theoretical Computer Science, Uniform Bss Model