3172 search results - page 43 / 635 » On the Random-Self-Reducibility of Complete Sets |
80
Voted
LFCS
1992
Springer
15 years 4 months ago
1992
Springer
This paper proves that "promise classes" are so fragilely structured that they do not robustly (i.e. with respect to all oracles) possess Turinghard sets even in classes...
APAL
2005
15 years 17 days ago
2005
We investigate operators which take a set X to a set relatively computably enumerable in and above X by studying which such sets X can be so mapped into the Turing degree of K. We...
103
Voted
JAIR
2008
15 years 20 days ago
2008
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
105
Voted
JUCS
2002
15 years 10 days ago
2002
Abstract: In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in whic...
87
Voted
TIP
2002
15 years 9 days ago
2002
In this correspondence, we prove that the affine invariants proposed recently by Yang and Cohen [1] are algebraically dependent. We show how to select an independent and complete s...