3172 search results - page 239 / 635 » On the Random-Self-Reducibility of Complete Sets |
133
click to vote
COCO
2003
Springer
15 years 12 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
192
click to vote
EURODAC
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper presents an algorithm for generation of test patterns for strong robust path delay faults, i.e. tests that propagate the fault along a single path and additionally are ...
146
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
In this paper, we consider various spatial relationships that are of general interest in pictorial database systems. We present a set of rules that allow us to deduce new relation...
165
Voted
DM
2010
15 years 6 months ago
2010
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
152
click to vote
ARSCOM
2002
15 years 6 months ago
2002
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...