|
ROLE
 Author only
AUTHOR PROFILE PAGES (BETA)
Project background
BOOKMARK & SHARE
|
|
|
|
| Export results as:
BibTeX
EndNotes
ACM Ref
|
| 1999
|
1
|
|
| 1998
|
2
|
|
On the relative sizes of learnable sets
Lance Fortnow, Rūsiņš Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
|
|
May 1998
|
|
Theoretical Computer Science
, Volume 197 Issue 1-2
|
|
Publisher: Elsevier Science Publishers Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 1 |
 |
|
|
Keywords: category, inductive inference, measure
|
| |
|
| 1997
|
3
|
|
Learning recursive functions from approximations
John Case, Susanne Kaufmann, Efim Kinber, Martin Kummer
|
|
August 1997
|
|
Journal of Computer and System Sciences
, Volume 55 Issue 1
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 5 |
|
|
|
|
| |
|
| 1996
|
4
|
|
Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
Martin Kummer
|
|
December 1996
|
|
SIAM Journal on Computing
, Volume 25 Issue 6
|
|
Publisher: Society for Industrial and Applied Mathematics
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 2 |
|
|
The way in which way Kolmogorov complexity and instance complexity affect properties of recursively enumerable (r.e.) sets is studied. The well-known $2\log n$ upper bound on the Kolmogorov complexity of initial segments of r. e. sets is shown to be ...
Keywords: Kolmogorov complexity, complete sets, instance complexity, recursively enumerable sets
|
| |
|
5
|
|
On the Query Complexity of Sets
Richard Beigel, William I. Gasarch, Martin Kummer, Timothy McNicholl, Frank Stephan
|
|
September 1996
|
|
MFCS '96: Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 1 |
|
|
|
|
| |
|
6
|
|
On resource-bounded instance complexity
Lance Fortnow, Martin Kummer
|
|
July 1996
|
|
Theoretical Computer Science
, Volume 161 Issue 1-2
|
|
Publisher: Elsevier Science Publishers Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 2 |
|
|
|
|
| |
|
7
|
|
Inclusion problems in parallel learning and games
Martin Kummer, Frank Stephan
|
|
June 1996
|
|
Journal of Computer and System Sciences
, Volume 52 Issue 3
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 1 |
|
|
|
|
| |
|
8
|
|
On the structure of degrees of inferability
Martin Kummer, Frank Stephan
|
|
April 1996
|
|
Journal of Computer and System Sciences
, Volume 52 Issue 2
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 10 |
|
|
|
|
| |
|
9
|
|
On the Complexity of Random Strings (Extended Abstract)
Martin Kummer
|
|
February 1996
|
|
STACS '96: Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 1 |
|
|
|
|
| |
|
10
|
|
Learning branches and learning to win closed games
Martin Kummer, Matthias Ott
|
|
January 1996
|
|
COLT '96: Proceedings of the ninth annual conference on Computational learning theory
|
|
Publisher: ACM
|
|
Full text available: |
 Pdf
(1.16 MB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 14, Downloads (12 Months): 25, Citation Count: 2 |
|
|
|
|
| |
|
|
|
|
|
Publisher Site