146 search results - page 14 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
ASIACRYPT
2008
Springer
14 years 21 days ago
2008
Springer
Abstract. In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, pa...
JCB
2008
13 years 11 months ago
2008
In this paper, we study k-noncrossing, -canonical RNA pseudoknot structures with minimum arc-length greater or equal to four. Let T OE4 k; .n/ denote the number of these structure...
APAL
1998
13 years 10 months ago
1998
We investigate the relationship of (jumps of) the degrees of splittings of a computably enumerable set and the degree of the set. We prove that there is a high computably enumerab...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
An algebraic field extension of Q or Z/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure F (either Q or Z/(p)). We consider the ...
CIE
2005
Springer
14 years 4 months ago
2005
Springer
Following Lutz’s approach to effective (constructive) dimension, we define a notion of dimension for individual sequences based on Schnorr’s concept(s) of randomness. In contr...