Effective Strong Dimension in Algorithmic Information and Computational Complexity

The two most important notions of fractal dimension are Hausdorff dimension, developed by Hausdorff [Math. Ann., 79 (1919), pp. 157-179], and packing dimension, developed independently by Tricot [Math. Proc. Cambridge Philos. Soc., 91 (1982), pp. 57-74] and Sullivan [Acta Math., 153 (1984), pp. 259-...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on computing Jg. 37; H. 3; S. 671 - 705
Hauptverfasser: Athreya, Krishna B., Hitchcock, John M., Lutz, Jack H., Mayordomo, Elvira
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.01.2007
Schlagworte:
ISSN:0097-5397, 1095-7111
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The two most important notions of fractal dimension are Hausdorff dimension, developed by Hausdorff [Math. Ann., 79 (1919), pp. 157-179], and packing dimension, developed independently by Tricot [Math. Proc. Cambridge Philos. Soc., 91 (1982), pp. 57-74] and Sullivan [Acta Math., 153 (1984), pp. 259-277]. Both dimensions have the mathematical advantage of being defined from measures, and both have yielded extensive applications in fractal geometry and dynamical systems. Lutz [Proceedings of the 15th IEEE Conference on Computational Complexity, Florence, Italy, 2000, IEEE Computer Society Press, Piscataway, NJ, 2000, pp. 158-169] has recently proven a simple characterization of Hausdorff dimension in terms of gales, which are betting strategies that generalize martingales. Imposing various computability and complexity constraints on these gales produces a spectrum of effective versions of Hausdorff dimension, including constructive, computable, polynomial-space, polynomial-time, and finite-state dimensions. Work by several investigators has already used these effective dimensions to shed significant new light on a variety of topics in theoretical computer science. In this paper we show that packing dimension can also be characterized in terms of gales. Moreover, even though the usual definition of packing dimension is considerably more complex than that of Hausdorff dimension, our gale characterization of packing dimension is an exact dual of--and every bit as simple as--the gale characterization of Hausdorff dimension. Effectivizing our gale characterization of packing dimension produces a variety of effective strong dimensions, which are exact duals of the effective dimensions mentioned above. In general (and in analogy with the classical fractal dimensions), the effective strong dimension of a set or sequence is at least as great as its effective dimension, with equality for sets or sequences that are sufficiently regular. We develop the basic properties of effective strong dimensions and prove a number of results relating them to fundamental aspects of randomness, Kolmogorov complexity, prediction, Boolean circuit-size complexity, polynomial-time degrees, and data compression. Aside from the above characterization of packing dimension, our two main theorems are the following. 1. If $\vec{\beta} = (\beta_0,\beta_1,\ldots)$ is a computable sequence of biases that are bounded away from 0 and $R$ is random with respect to $\vec{\beta}$, then the dimension and strong dimension of $R$ are the lower and upper average entropies, respectively, of $\vec{\beta}$. 2. For each pair of $\Delta^0_2$-computable real numbers $0 < \alpha \le \beta \le 1$, there exists $A \in {\rm E}$ such that the polynomial-time many-one degree of $A$ has dimension $\alpha$ in E and strong dimension $\beta$ in E. Our proofs of these theorems use a new large deviation theorem for self-information with respect to a bias sequence $\vec{\beta}$ that need not be convergent.
AbstractList The two most important notions of fractal dimension are Hausdorff dimension, developed by Hausdorff [Math. Ann., 79 (1919), pp. 157-179], and packing dimension, developed independently by Tricot [Math. Proc. Cambridge Philos. Soc., 91 (1982), pp. 57-74] and Sullivan [Acta Math., 153 (1984), pp. 259-277]. Both dimensions have the mathematical advantage of being defined from measures, and both have yielded extensive applications in fractal geometry and dynamical systems. Lutz [Proceedings of the 15th IEEE Conference on Computational Complexity, Florence, Italy, 2000, IEEE Computer Society Press, Piscataway, NJ, 2000, pp. 158-169] has recently proven a simple characterization of Hausdorff dimension in terms of gales, which are betting strategies that generalize martingales. Imposing various computability and complexity constraints on these gales produces a spectrum of effective versions of Hausdorff dimension, including constructive, computable, polynomial-space, polynomial-time, and finite-state dimensions. Work by several investigators has already used these effective dimensions to shed significant new light on a variety of topics in theoretical computer science. In this paper we show that packing dimension can also be characterized in terms of gales. Moreover, even though the usual definition of packing dimension is considerably more complex than that of Hausdorff dimension, our gale characterization of packing dimension is an exact dual of--and every bit as simple as--the gale characterization of Hausdorff dimension. Effectivizing our gale characterization of packing dimension produces a variety of effective strong dimensions, which are exact duals of the effective dimensions mentioned above. In general (and in analogy with the classical fractal dimensions), the effective strong dimension of a set or sequence is at least as great as its effective dimension, with equality for sets or sequences that are sufficiently regular. We develop the basic properties of effective strong dimensions and prove a number of results relating them to fundamental aspects of randomness, Kolmogorov complexity, prediction, Boolean circuit-size complexity, polynomial-time degrees, and data compression. Aside from the above characterization of packing dimension, our two main theorems are the following. 1. If $\vec{\beta} = (\beta_0,\beta_1,\ldots)$ is a computable sequence of biases that are bounded away from 0 and $R$ is random with respect to $\vec{\beta}$, then the dimension and strong dimension of $R$ are the lower and upper average entropies, respectively, of $\vec{\beta}$. 2. For each pair of $\Delta^0_2$-computable real numbers $0 < \alpha \le \beta \le 1$, there exists $A \in {\rm E}$ such that the polynomial-time many-one degree of $A$ has dimension $\alpha$ in E and strong dimension $\beta$ in E. Our proofs of these theorems use a new large deviation theorem for self-information with respect to a bias sequence $\vec{\beta}$ that need not be convergent.
Author Athreya, Krishna B.
Lutz, Jack H.
Mayordomo, Elvira
Hitchcock, John M.
Author_xml – sequence: 1
  givenname: Krishna B.
  surname: Athreya
  fullname: Athreya, Krishna B.
– sequence: 2
  givenname: John M.
  surname: Hitchcock
  fullname: Hitchcock, John M.
– sequence: 3
  givenname: Jack H.
  surname: Lutz
  fullname: Lutz, Jack H.
– sequence: 4
  givenname: Elvira
  surname: Mayordomo
  fullname: Mayordomo, Elvira
BookMark eNp9kE9LAzEUxINUsK1-AG-L99W87J9sjqVWLRQEq-clm77UlN2kJqnYb--29aTg6THMzOPHjMjAOouEXAO9Bcj43ZJSwYtMcJrleSmAnZEhUFGkHAAGZHiw04N_QUYhbCiFPIdsSF5mWqOK5hOTZfTOrpN706ENxtnE2GTSrp038b0zKplb7Xwn48GSdpVMXbfdxaOW7VG1-GXi_pKca9kGvPq5Y_L2MHudPqWL58f5dLJIFeMsppJrWjKOjNFVU1UrBoVC1ZNnCKyoGqYkqrxsUAjQSudVA7IELRALxVE12ZjcnP5uvfvYYYj1xu18zxJqAVVZZVBAH-KnkPIuBI-6VubEHL00bQ20PuxX_9mvb8Kv5tabTvr9P51vuuF1Bg
CitedBy_id crossref_primary_10_1016_j_ic_2010_09_006
crossref_primary_10_1137_070684689
crossref_primary_10_3233_COM_190292
crossref_primary_10_1016_j_tcs_2010_09_005
crossref_primary_10_1017_jsl_2017_78
crossref_primary_10_1016_j_ic_2024_105137
crossref_primary_10_1016_j_ipl_2008_05_028
crossref_primary_10_1007_s00224_009_9170_1
crossref_primary_10_1016_j_jmva_2024_105380
crossref_primary_10_1016_j_tcs_2023_113693
crossref_primary_10_1007_s00224_007_9013_x
crossref_primary_10_1016_j_ic_2023_105078
crossref_primary_10_1016_j_ic_2007_05_003
crossref_primary_10_2178_jsl_1333566632
crossref_primary_10_1145_3460948
crossref_primary_10_1016_j_apal_2014_07_001
crossref_primary_10_1007_s00224_012_9417_0
crossref_primary_10_1016_j_tcs_2012_10_045
crossref_primary_10_1002_malq_201100096
crossref_primary_10_1145_3733607
crossref_primary_10_1215_00294527_1731416
crossref_primary_10_1007_s00224_010_9288_1
crossref_primary_10_1016_j_jcss_2020_12_003
crossref_primary_10_1016_j_tcs_2010_03_026
crossref_primary_10_2178_jsl_1318338846
crossref_primary_10_1145_3201783
crossref_primary_10_1145_2786566
crossref_primary_10_3233_COM_160066
crossref_primary_10_1016_j_tcs_2011_08_023
crossref_primary_10_1016_j_tcs_2021_08_027
crossref_primary_10_1109_TIT_2021_3085425
crossref_primary_10_1145_2493252_2493257
crossref_primary_10_1002_malq_200710060
crossref_primary_10_1016_j_ipl_2013_04_004
crossref_primary_10_1016_j_tcs_2010_02_013
Cites_doi 10.1145/321892.321894
10.1016/S0890-5401(03)00187-1
10.1016/S0022-0000(05)80073-X
10.1016/S0304-3975(01)00340-1
10.2307/2274360
10.1016/S0304-3975(03)00138-5
10.1007/BF02392379
10.14492/hokmj/1350911778
10.1137/S0097539796302269
10.1016/S0020-0190(02)00454-4
10.1016/S0020-0190(02)00343-5
10.1006/jcom.1994.1015
10.2307/1969123
10.1002/j.1538-7305.1948.tb01338.x
10.1007/BF01694181
10.1006/inco.1993.1017
10.1016/j.jcss.2004.10.007
10.1109/TIT.1978.1055911
10.1016/S0304-3975(95)00260-X
10.1016/S0304-3975(03)00244-5
10.1007/BF01457179
10.1017/S0305004196001089
10.1016/S0022-0000(73)80030-3
10.1016/0022-0000(92)90020-J
10.1137/S0097539701417723
10.1016/S0019-9958(66)80018-9
10.1007/s002240000086
10.1109/TIT.1978.1055934
10.1017/S0305004100059119
10.1007/s00224-004-1122-1
ContentType Journal Article
Copyright [Copyright] © 2007 Society for Industrial and Applied Mathematics
Copyright_xml – notice: [Copyright] © 2007 Society for Industrial and Applied Mathematics
DBID AAYXX
CITATION
3V.
7RQ
7WY
7WZ
7X2
7XB
87Z
88A
88F
88I
88K
8AL
8FE
8FG
8FH
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
ATCPS
AZQEC
BBNVY
BENPR
BEZIV
BGLVJ
BHPHI
CCPQU
D1I
DWQXO
FRNLG
F~G
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
KB.
L.-
L6V
LK8
M0C
M0K
M0N
M1Q
M2O
M2P
M2T
M7P
M7S
MBDVC
P5Z
P62
PATMY
PDBOC
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
PYCSY
Q9U
S0W
U9A
DOI 10.1137/S0097539703446912
DatabaseName CrossRef
ProQuest Central (Corporate)
Career & Technical Education Database (ProQuest)
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
Agricultural Science Collection
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Biology Database (Alumni Edition)
Military Database (Alumni Edition)
Science Database (Alumni Edition)
Telecommunications (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Natural Science Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Research Library (Alumni)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
Agricultural & Environmental Science Collection
ProQuest Central Essentials
Biological Science Collection
ProQuest Central
Business Premium Collection
ProQuest Technology Collection
Natural Science Collection
ProQuest One
ProQuest Materials Science Collection
ProQuest Central Korea
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
ProQuest Research Library
SciTech Collection (ProQuest)
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
Materials Science Database
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Biological Science Collection
ABI/INFORM Global
Agriculture Science Database
Computing Database
Military Database
Research Library
Science Database (ProQuest)
Telecommunications Database
Biological Science Database (ProQuest)
Engineering Database
Research Library (Corporate)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Environmental Science Database
Materials Science Collection
Proquest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
Environmental Science Collection
ProQuest Central Basic
DELNET Engineering & Technology Collection
DatabaseTitle CrossRef
Agricultural Science Database
ProQuest Business Collection (Alumni Edition)
Research Library Prep
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest Military Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest Telecommunications
ProQuest One Applied & Life Sciences
Natural Science Collection
Biological Science Collection
ProQuest Central (New)
Engineering Collection
Career and Technical Education (Alumni Edition)
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest Biological Science Collection
ProQuest One Academic Eastern Edition
Agricultural Science Collection
ProQuest Technology Collection
ProQuest Telecommunications (Alumni Edition)
Biological Science Database
ProQuest Business Collection
Environmental Science Collection
ProQuest Career and Technical Education
ProQuest One Academic UKI Edition
Environmental Science Database
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
ProQuest One Academic Middle East (New)
Materials Science Collection
ProQuest Central (Alumni Edition)
ProQuest One Community College
Research Library (Alumni Edition)
ProQuest Natural Science Collection
ProQuest Biology Journals (Alumni Edition)
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
Agricultural & Environmental Science Collection
Materials Science Database
ProQuest Research Library
ABI/INFORM Complete (Alumni Edition)
ProQuest Materials Science Collection
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest Military Collection (Alumni Edition)
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest DELNET Engineering and Technology Collection
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList Agricultural Science Database
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1095-7111
EndPage 705
ExternalDocumentID 2573855561
10_1137_S0097539703446912
GroupedDBID --Z
-DZ
-~X
.4S
.DC
123
4.4
7RQ
7WY
7X2
7XC
88I
8CJ
8FE
8FG
8FH
8FL
8G5
8V8
AALVN
AASXH
AAYXX
ABDBF
ABDPE
ABJCF
ABKAD
ABMZU
ABPPZ
ABUFD
ABUWG
ACBEA
ACGFO
ACGOD
ACIWK
ACNCT
ACPRK
ACUHS
ADBBV
ADMHC
ADXHL
AEMOZ
AENEX
AFFHD
AFKRA
AFRAH
AHQJS
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ANXRF
ARAPS
ARCSS
ATCPS
AZQEC
BBNVY
BENPR
BEZIV
BGLVJ
BHPHI
BPHCQ
CCPQU
CITATION
CS3
CZ9
D1I
D1J
D1K
DQ2
DU5
DWQXO
EAP
EAS
EBR
EBS
EBU
ECS
EDO
EJD
EMK
EST
ESX
FRNLG
GNUQQ
GUQSH
H13
HCIFZ
H~9
I-F
K1G
K6-
K60
K6V
K6~
K7-
KB.
KC.
L6V
LK5
LK8
M0C
M0K
M1Q
M2O
M2P
M7P
M7R
M7S
MK~
NHB
OHT
P1Q
P2P
P62
PATMY
PDBOC
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PTHSS
PYCSY
RJG
RNS
RSI
S0W
TAE
TH9
TN5
TUS
TWZ
UHB
UQL
VOH
WH7
WHG
XJE
YNT
YYP
YZZ
ZCG
ZY4
3V.
7XB
88A
88K
8AL
8FK
JQ2
L.-
M0N
M2T
MBDVC
PKEHL
PQEST
PQUKI
PRINS
Q9U
U9A
XJT
ID FETCH-LOGICAL-c272t-a7f0627e220db88d215cec9123e1258b2caec46be991fcf48b1a61f9ee5c7ecb3
IEDL.DBID 7RQ
ISICitedReferencesCount 60
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000249690800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0097-5397
IngestDate Fri Jul 25 11:08:24 EDT 2025
Sat Nov 29 03:54:34 EST 2025
Tue Nov 18 21:35:33 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c272t-a7f0627e220db88d215cec9123e1258b2caec46be991fcf48b1a61f9ee5c7ecb3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
PQID 918683151
PQPubID 666313
PageCount 35
ParticipantIDs proquest_journals_918683151
crossref_citationtrail_10_1137_S0097539703446912
crossref_primary_10_1137_S0097539703446912
PublicationCentury 2000
PublicationDate 2007-01-00
20070101
PublicationDateYYYYMMDD 2007-01-01
PublicationDate_xml – month: 01
  year: 2007
  text: 2007-01-00
PublicationDecade 2000
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle SIAM journal on computing
PublicationYear 2007
Publisher Society for Industrial and Applied Mathematics
Publisher_xml – name: Society for Industrial and Applied Mathematics
References R41
R43
R20
R42
R23
R45
R25
R24
R27
R49
R26
R48
Ryabko B. Ya. (R30) 1986; 22
Ryabko B. Ya. (R29) 1984; 30
R2
Vovk V. G. (R47) 1987; 35
R4
R5
R6
R7
Ryabko B. Ya. (R31) 1993; 29
R32
R12
R11
R33
R14
R13
R35
R16
R38
R15
R37
R17
R39
References_xml – ident: R6
  doi: 10.1145/321892.321894
– ident: R24
  doi: 10.1016/S0890-5401(03)00187-1
– ident: R5
  doi: 10.1016/S0022-0000(05)80073-X
– ident: R13
  doi: 10.1016/S0304-3975(01)00340-1
– ident: R45
  doi: 10.2307/2274360
– ident: R14
  doi: 10.1016/S0304-3975(03)00138-5
– ident: R41
  doi: 10.1007/BF02392379
– ident: R42
  doi: 10.14492/hokmj/1350911778
– ident: R4
  doi: 10.1137/S0097539796302269
– ident: R15
  doi: 10.1016/S0020-0190(02)00454-4
– ident: R27
  doi: 10.1016/S0020-0190(02)00343-5
– ident: R32
  doi: 10.1006/jcom.1994.1015
– volume: 30
  start-page: 219
  issn: 0197-6788
  year: 1984
  ident: R29
  publication-title: Soviet Math. Dokl.
– ident: R17
  doi: 10.2307/1969123
– ident: R37
  doi: 10.1002/j.1538-7305.1948.tb01338.x
– ident: R33
  doi: 10.1007/BF01694181
– volume: 35
  start-page: 656
  issn: 0197-6788
  year: 1987
  ident: R47
  publication-title: Soviet Math. Dokl.
– ident: R38
  doi: 10.1006/inco.1993.1017
– volume: 29
  start-page: 186
  issn: 0032-9460
  year: 1993
  ident: R31
  publication-title: Probl. Inform. Transm.
– ident: R11
  doi: 10.1016/j.jcss.2004.10.007
– ident: R48
  doi: 10.1109/TIT.1978.1055911
– ident: R2
  doi: 10.1016/S0304-3975(95)00260-X
– ident: R7
  doi: 10.1016/S0304-3975(03)00244-5
– ident: R12
  doi: 10.1007/BF01457179
– ident: R26
  doi: 10.1017/S0305004196001089
– ident: R35
  doi: 10.1016/S0022-0000(73)80030-3
– ident: R20
  doi: 10.1016/0022-0000(92)90020-J
– ident: R23
  doi: 10.1137/S0097539701417723
– volume: 22
  start-page: 170
  issn: 0032-9460
  year: 1986
  ident: R30
  publication-title: Probl. Inform. Transm.
– ident: R25
  doi: 10.1016/S0019-9958(66)80018-9
– ident: R39
  doi: 10.1007/s002240000086
– ident: R49
  doi: 10.1109/TIT.1978.1055934
– ident: R43
  doi: 10.1017/S0305004100059119
– ident: R16
  doi: 10.1007/s00224-004-1122-1
SSID ssj0014413
Score 2.1563413
Snippet The two most important notions of fractal dimension are Hausdorff dimension, developed by Hausdorff [Math. Ann., 79 (1919), pp. 157-179], and packing...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 671
SubjectTerms Algorithms
Applied mathematics
Boolean
Computer science
Data compression
Dynamical systems
Fractals
Geometry
Investigations
Theorems
Title Effective Strong Dimension in Algorithmic Information and Computational Complexity
URI https://www.proquest.com/docview/918683151
Volume 37
WOSCitedRecordID wos000249690800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: 7WY
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M0C
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: P5Z
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Agriculture Science Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M0K
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/agriculturejournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Biological Science Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M7P
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/biologicalscijournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Career & Technical Education Database (ProQuest)
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: 7RQ
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/career
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: K7-
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M7S
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Environmental Science Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: PATMY
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/environmentalscience
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Materials Science Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: KB.
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/materialsscijournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Military Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M1Q
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/military
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: BENPR
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Research Library
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M2O
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/pqrl
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Science Database (ProQuest)
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M2P
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/sciencejournals
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB5R6KEcgNIi3vKhJyS3eXjj-IR4ConudlloS3uJYseGlSA8NiDx75lxvCshJC5cPsWK40Qee2Yytr8B-FaKKnHOCe5io7nQTnIlUsuFNFpoq2XH8xT8-Sl7vfz8XPXD3pxR2FY51oleUVc3hmLkPxTxuqdon7Zv7zgljaLF1ZBB4wPMoJ3OaJjLwclkEQEtfSChlLyDdjcsasYpMUZHdKJUSWK8y1ScvDRLL7WyNzWH8-_8yAWYCz4m22kHxWeYsvUizI_zN7AwnRdhtjvhbB19gUFLZIzaj51SfPyC7RPzP0XT2LBmO1cX-Krm8npoWDjDRDJlZV2xtukQVvQlotlsnr7C78ODs70jHjIucJPIpOGldERbbJMkqnSeV-gPGGuwe1KLHZzrxJTWiExb9CqdcSLXcZnFTlnbMdIanS7BdH1T22VguY4sNoX-VCUFOp06K4Uyla00-kxaqRWIxh1emEBHTlkxrgr_W5LK4pWMVmBr8shty8XxVuW1sYiKMC1HxUQ-q2_eXYNPbQiXIi3rMN3cP9gN-Ggem-HoftMPMsK__zZhZveg1x9g6Vhywt3viN1oz-MxYUx1u8kvj32PZ4TSX8tTxH7n_zNAnOYx
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8QwEB58gXrwLb7NQS9CcJtmN81BRHyg7LqIL7zVJk3WBa2PrYo_yv9opk0XRPDmwWNpG0jzdb7JTOYbgI2Ep8xay6kNtKJcWUElDw3lQiuujBL1QqfguiXa7ejmRp4NwGdVC4PHKiubWBjq9FFjjHxboq576Php9-mZYtMoTK5WHTRKVDTNx7vbsfV2Tg7c8m4ydnR4uX9MfVMBqplgOU2ERWVew1gtVVGUOsrTRktnwI3j-kgxnRjNG8o4x8lqyyMVJI3ASmPqWhitQjfuIAzzMBL4WzUF7SctnGfhRS8FrTue90nUIESF6hpWsEqBCnsNGbDvNPidBQpqO5r8Zx9lCia8D032StBPw4DJZmCy6k9BvLmagfHTviZtbxbOS6FmZ93JBcb_O-QAOxtgtJB0M7J333FTy-8eupr4Gi3ELEmylJRD-7BpcYUyovnHHFz9yTznYSh7zMwCkEjVjBvK-Yup4M6pVo2ES52aVDmfUEm5CLVqgWPt5dax68d9XGy7QhH_wMQibPVfeSq1Rn57eLmCROzNTi_u42Hp17vrMHp8edqKWyft5jKMleFqjCqtwFD-8mpWYUS_5d3ey1oBcAK3fw2eL9XnOIo
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Effective+Strong+Dimension+in+Algorithmic+Information+and+Computational+Complexity&rft.jtitle=SIAM+journal+on+computing&rft.au=Athreya%2C+Krishna+B.&rft.au=Hitchcock%2C+John+M.&rft.au=Lutz%2C+Jack+H.&rft.au=Mayordomo%2C+Elvira&rft.date=2007-01-01&rft.issn=0097-5397&rft.eissn=1095-7111&rft.volume=37&rft.issue=3&rft.spage=671&rft.epage=705&rft_id=info:doi/10.1137%2FS0097539703446912&rft.externalDBID=n%2Fa&rft.externalDocID=10_1137_S0097539703446912
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0097-5397&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0097-5397&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0097-5397&client=summon