License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1858
URN: urn:nbn:de:0030-drops-22667
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2266/
Gaßner, Christine
Contributed Papers

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

pdf-format:
Dokument 1.pdf (328 KB)

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:DSP:2009:2266,
  author =	{Christine Ga{\"s}ner},
  title =	{Relativizations  of the   P =? DNP Question for the BSS Model},
  booktitle =	{6th Int'l Conf. on Computability and Complexity in Analysis},
  year =	{2009},
  editor =	{Andrej Bauer and Peter Hertling and Ker-I Ko},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2266},
  annote =	{Keywords: BSS machines, oracle machines, relativizations, P-DNP problem, real knapsack problem},
}

Keywords: BSS machines, oracle machines, relativizations, P-DNP problem, real knapsack problem
Seminar: 6th Int'l Conf. on Computability and Complexity in Analysis
Documenttype: InProceedings
Issue date: 2009
Date of publication: 25.11.2009

DROPS-Home | Fulltext Search | Imprint Published by LZI