-
1
-
-
0034871624
-
Hausdorff dimension in exponential time
-
K. Ambos-Spies, W. Merkle, J. Reimann, F. Stephan, Hausdorff dimension in exponential time, in: Proceedings of the 16th IEEE Conference on Computational Complexity, 2001, pp. 210-217.
-
(2001)
Proceedings of the 16th IEEE Conference on Computational Complexity
, pp. 210-217
-
-
Ambos-Spies, K.1
Merkle, W.2
Reimann, J.3
Stephan, F.4
-
2
-
-
35048836635
-
Effective strong dimension in algorithmic information and computational complexity
-
K.B. Athreya, J.M. Hitchcock, J.H. Lutz, E. Mayordomo, Effective strong dimension in algorithmic information and computational complexity, in: Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science, 2004, pp. 632-643.
-
(2004)
Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science
, pp. 632-643
-
-
Athreya, K.B.1
Hitchcock, J.M.2
Lutz, J.H.3
Mayordomo, E.4
-
3
-
-
35248847451
-
Infinitely-often autoreducible sets
-
R. Beigel, L. Fortnow, F. Stephan, Infinitely-often autoreducible sets, in: Proceedings of the 14th Annual International Symposium on Algorithms and Computation, 2003, pp. 98-107.
-
(2003)
Proceedings of the 14th Annual International Symposium on Algorithms and Computation
, pp. 98-107
-
-
Beigel, R.1
Fortnow, L.2
Stephan, F.3
-
4
-
-
0002672692
-
The fractional dimension of a set defined by decimal properties
-
Eggleston H. The fractional dimension of a set defined by decimal properties. Q. J. Math. 20:1949;31-36.
-
(1949)
Q. J. Math.
, vol.20
, pp. 31-36
-
-
Eggleston, H.1
-
7
-
-
34250950477
-
Dimension und äusseres Mass
-
Hausdorff F. Dimension und äusseres Mass. Math. Ann. 79:1919;157-179.
-
(1919)
Math. Ann.
, vol.79
, pp. 157-179
-
-
Hausdorff, F.1
-
8
-
-
0037811185
-
Fractal dimension and logarithmic loss unpredictability
-
Hitchcock J.M. Fractal dimension and logarithmic loss unpredictability. Theoret. Comput. Sci. 304(1-3):2003;431-441.
-
(2003)
Theoret. Comput. Sci.
, vol.304
, Issue.1-3
, pp. 431-441
-
-
Hitchcock, J.M.1
-
9
-
-
0037163961
-
MAX3SAT is exponentially hard to approximate if NP has positive dimension
-
Hitchcock J.M. MAX3SAT is exponentially hard to approximate if NP has positive dimension. Theoret. Comput. Sci. 289(1):2002;861-869.
-
(2002)
Theoret. Comput. Sci.
, vol.289
, Issue.1
, pp. 861-869
-
-
Hitchcock, J.M.1
-
10
-
-
0041127568
-
Completeness and weak completeness under polynomial-size circuits
-
Juedes D.W., Lutz J.H. Completeness and weak completeness under polynomial-size circuits. Inform. and Comput. 125(1):1996;13-31.
-
(1996)
Inform. and Comput.
, vol.125
, Issue.1
, pp. 13-31
-
-
Juedes, D.W.1
Lutz, J.H.2
-
12
-
-
0345106454
-
On the synthesis of contact networks
-
Lupanov O.B. On the synthesis of contact networks. Dokl. Akad. Nauk SSSR. 119:1958;23-26.
-
(1958)
Dokl. Akad. Nauk SSSR
, vol.119
, pp. 23-26
-
-
Lupanov, O.B.1
-
13
-
-
0026851355
-
Almost everywhere high nonuniform complexity
-
Lutz J.H. Almost everywhere high nonuniform complexity. J. Comput. System Sci. 44(2):1992;220-258.
-
(1992)
J. Comput. System Sci.
, vol.44
, Issue.2
, pp. 220-258
-
-
Lutz, J.H.1
-
14
-
-
0345227319
-
Dimension in complexity classes
-
Lutz J.H. Dimension in complexity classes. SIAM J. Comput. 32(5):2003;1236-1250. (preliminary version appeared in Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000, pp. 158-169).
-
(2003)
SIAM J. Comput.
, vol.32
, Issue.5
, pp. 1236-1250
-
-
Lutz, J.H.1
-
16
-
-
0344118726
-
The dimensions of individual strings and sequences
-
Lutz J.H. The dimensions of individual strings and sequences. Inform. and Comput. 187:2003;49-79.
-
(2003)
Inform. and Comput.
, vol.187
, pp. 49-79
-
-
Lutz, J.H.1
-
18
-
-
0004122682
-
-
Cambridge: Cambridge University Press. (originally published in 1970)
-
Rogers C.A. Hausdorff Measures. 1998;Cambridge University Press, Cambridge. (originally published in 1970).
-
(1998)
Hausdorff Measures
-
-
Rogers, C.A.1
-
19
-
-
0002894287
-
Klassifikation der Zufallsgesetze nach Komplexität und Ordnung
-
Schnorr C.P. Klassifikation der Zufallsgesetze nach Komplexität und Ordnung. Z. Wahrsch. Verw. Geb. 16:1970;1-21.
-
(1970)
Z. Wahrsch. Verw. Geb.
, vol.16
, pp. 1-21
-
-
Schnorr, C.P.1
-
20
-
-
0000583779
-
An unified approach to the definition of random sequences
-
Schnorr C.P. An unified approach to the definition of random sequences. Math. Systems Theory. 5:1971;246-258.
-
(1971)
Math. Systems Theory
, vol.5
, pp. 246-258
-
-
Schnorr, C.P.1
-
21
-
-
0002411710
-
Zufälligkeit und Wahrscheinlichkeit
-
Springer-Verlag
-
C.P. Schnorr, Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics, Vol. 218, Springer-Verlag, 1971.
-
(1971)
Lecture Notes in Mathematics
, vol.218
-
-
Schnorr, C.P.1
-
22
-
-
0015902552
-
Process complexity and effective random tests
-
Schnorr C.P. Process complexity and effective random tests. J. Comput. System Sci. 7:1973;376-388.
-
(1973)
J. Comput. System Sci.
, vol.7
, pp. 376-388
-
-
Schnorr, C.P.1
|