Sciweavers

17 search results - page 1 / 4
» Relativizations of the P =
Sort
View
CSL
2007
Springer
13 years 11 months ago
Relativizing Small Complexity Classes and Their Theories
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....
Klaus Aehlig, Stephen Cook, Phuong Nguyen
JUCS
2010
82views more  JUCS 2010»
12 years 11 months ago
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...
Christine Gaßner
CCA
2009
Springer
13 years 11 months ago
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 whethe...
Christine Gaßner
MDBIS
2004
92views Database» more  MDBIS 2004»
13 years 6 months ago
Ein verteilter XML-Speicher in Ad-hoc-Netzwerken
Abstract: Overlay- oder Peer-to-Peer-Netzwerke (P2P-Netzwerke) sind relativ einfach aufgebaute Strukturen, die momentan nur eine einfache Anfragebearbeitung unterst
Holger Meyer, Andre Zeitz
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
13 years 8 months ago
The Instance Complexity Conjecture
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
Martin Kummer