Access Restriction

Author Orponen, Pekka ♦ Ko, Ker-i ♦ Schning, Uwe ♦ Watanabe, Osamu
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1994
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Kolmogorov complexity ♦ Completeness ♦ Nonuniform complexity ♦ Paddability ♦ Self-reducibility
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1994-01-02
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 41
Issue Number 1
Page Count 26
Starting Page 96
Ending Page 121

Open content in new tab

   Open content in new tab
Source: ACM Digital Library