메뉴 건너뛰기




Volumn 69, Issue 2, 2004, Pages 97-122

Scaled dimension and nonuniform complexity

Author keywords

Circuit complexity; Computational complexity; Gales; Hausdorff dimension; Kolmogorov complexity; Resource bounded dimension; Scaled dimension

Indexed keywords

COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

EID: 3342972227     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2003.09.001     Document Type: Article
Times cited : (19)

References (23)
  • 4
    • 0002672692 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.