Sciweavers

1538 search results - page 109 / 308
» Relative Randomness and Cardinality
Sort
View
STACS
2010
Springer
15 years 4 months ago
Inseparability and Strong Hypotheses for Disjoint NP Pairs
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP do...
Lance Fortnow, Jack H. Lutz, Elvira Mayordomo
IPPS
2003
IEEE
15 years 3 months ago
CORBA Benchmarking: A Course with Hidden Obstacles
Numerous projects have evaluated the performance of CORBA middleware over the past decade. Interestingly, many of the published results are either gathered or analyzed imprecisely...
Adam Buble, Lubomír Bulej, Petr Tuma
ICALP
1992
Springer
15 years 2 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
ACSD
2003
IEEE
102views Hardware» more  ACSD 2003»
15 years 1 months ago
Specification Coverage Aided Test Selection
In this paper test selection strategies in formal conformance testing are considered. As the testing conformance relation we use the ioco relation, and extend the previously prese...
Tuomo Pyhälä, Keijo Heljanko
APAL
2010
125views more  APAL 2010»
14 years 10 months ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day