74 search results - page 4 / 15 » Every Computably Enumerable Random Real Is Provably Computab... |
160
Voted
CIE
2005
Springer
16 years 29 days 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...
184
Voted
SWAT
2004
Springer
16 years 23 days ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
167
Voted
CIE
2009
Springer
16 years 2 months ago
2009
Springer
We show that every real low for Demuth randomness is of hyperimmune-free degree.
171
Voted
NDJFL
2010
15 years 2 months ago
2010
The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class o...
170
Voted
CSE
2009
IEEE
16 years 2 months ago
2009
IEEE
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...