When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.CCA.2009.2266
URN: urn:nbn:de:0030-drops-22667
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2266/
 Go to the corresponding Portal

Gaßner, Christine
Contributed Papers

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

 pdf-format:

### Abstract

We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form $x\geq 0$. The oracle machines can also check whether a tuple of real numbers belongs to a given oracle set ${\cal O}$ or not. We construct oracles such that the classes P and DNP relative to these oracles are equal or not equal.

### BibTeX - Entry

@InProceedings{ganer:OASIcs:2009:2266,
author =	{Christine Ga{\ss}ner},
title =	{{Relativizations  of the   P =? DNP Question for the BSS Model}},
booktitle =	{6th International Conference on Computability and Complexity in Analysis (CCA'09)},
series =	{OpenAccess Series in Informatics (OASIcs)},
ISBN =	{978-3-939897-12-5},
ISSN =	{2190-6807},
year =	{2009},
volume =	{11},
editor =	{Andrej Bauer and Peter Hertling and Ker-I Ko},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},