Martin Kummer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 47 from 47

2007

Cuppability of Simple and Hypersimple SetsMartin Kummer, Marcus Schäfer. ndjfl, 48(3):349-369, 2007. [doi]

1998

On the Relative Sizes of Learnable SetsLance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan. TCS, 197(1-2):139-156, 1998. [doi]

1997

Learning Recursive Functions from ApproximationsJohn Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer. jcss, 55(1):183-196, 1997.

1996

On the Query Complexity of SetsRichard Beigel, William I. Gasarch, Martin Kummer, Timothy McNicholl, Frank Stephan. mfcs 1996: 206-217

On Resource-Bounded Instance ComplexityLance Fortnow, Martin Kummer. TCS, 161(1&2):123-140, 1996. [doi]

On a Quantitative Notion of UniformitySusanne Kaufmann, Martin Kummer. FUIN, 25(1):59-78, 1996.

On the Structure of Degrees of InferabilityMartin Kummer, Frank Stephan. jcss, 52(2):214-238, 1996.

Learning Branches and Learning to Win Closed GamesMartin Kummer, Matthias Ott. colt 1996: 280-291 [doi]

On the Complexity of Random Strings (Extended Abstract)Martin Kummer. STACS 1996: 25-36

Inclusion Problems in Parallel Learning and GamesMartin Kummer, Frank Stephan. jcss, 52(3):403-420, 1996.

Kolmogorov Complexity and Instance Complexity of Recursively Enumerable SetsMartin Kummer. SICOMP, 25(6):1123-1143, 1996.

1995

Approximable SetsRichard Beigel, Martin Kummer, Frank Stephan. iandc, 120(2):304-314, August 1995.

Quantifying the Amount of VerbosenessRichard Beigel, Martin Kummer, Frank Stephan. iandc, 118(1):73-90, April 1995.

Learning recursive functions from approximationsJohn Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer. eurocolt 1995: 140-153

Resource-Bounded Instance Complexity (Extended Abstract)Lance Fortnow, Martin Kummer. STACS 1995: 597-608

Measure, Category and Learning TheoryLance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan. icalp 1995: 558-569

On a Quantitative Notion of UniformitySusanne Kaufmann, Martin Kummer. mfcs 1995: 169-178

Computability of Convex Sets (Extended Abstract)Martin Kummer, Marcus Schäfer. STACS 1995: 550-561

A Learning-Theoretic Characterization of Classes of Recursive FunctionsMartin Kummer. ipl, 54(4):205-211, 1995. [doi]

Recursion Theoretic Properties of Frequency Computation and Bounded QueriesMartin Kummer, Frank Stephan. iandc, 120(1):59-77, July 1995.

Effective Strategies for Enumeration GamesMartin Kummer, Matthias Ott. csl 1996: 368-387

The Instance Complexity ConjectureMartin Kummer. cocoon 1995: 111-124

The Power of Frequency Computation (Extended Abstract)Martin Kummer, Frank Stephan. fct 1995: 323-332

1994

1993

Herbrand s Theorem for Nonstandard Inference Operations (Abstract)Jürgen Dix, Martin Kummer. JSYML, 58(3):1116-1117, 1993.

Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract)Martin Kummer, Frank Stephan. kgc 1993: 243-254

On the Structure of Degrees of InferabilityMartin Kummer, Frank Stephan. colt 1993: 117-126 [doi]

Weakly Semirecursive Sets and r.e. OrderingsMartin Kummer, Frank Stephan. APAL, 60(2):133-150, 1993.

1992

1991

Diagonals and Semihyperhypersimple SetsMartin Kummer. JSYML, 56(3):1068-1074, 1991.

1990

An Easy Priority-Free Proof of a Theorem of FriedbergMartin Kummer. TCS, 74(2):249-251, 1990.

Some applications of computable one-one numberingsMartin Kummer. AML, 30(4):219-230, 1990. [doi]

1989

A Note on Direct Sums of FriedbergnumberingsMartin Kummer. JSYML, 54(3):1009-1010, 1989.

Beiträge zur Theorie der Numerierungen: eindeutige NumerierungenMartin Kummer. PhD thesis, Karlsruhe Institute of Technology, Germany, 1989. [doi]

1988

Numberings of R::1:: union FMartin Kummer. csl 1989: 166-186

The Length Problem for Co-R.E. SetsMartin Kummer. mlq, 34(3):277-282, 1988. [doi]

1987

Negative Results about the Length ProblemMartin Kummer. BIRTHDAY 1987: 237-248

Sign in or sign up to see more results.

runs on WebDSL