License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
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://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2266/
Go to the corresponding OASIcs Volume Portal

Gaßner, Christine
Contributed Papers

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

pdf-format:
Gassner.2266.pdf (0.3 MB)

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 =l 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},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2266},
  URN =		{urn:nbn:de:0030-drops-22667},
  doi =		{10.4230/OASIcs.CCA.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
Collection: 6th International Conference on Computability and Complexity in Analysis (CCA'09)
Issue Date: 2009
Date of publication: 25.11.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI