Martin Kummer

According to our database, Martin Kummer authored at least 44 papers between 1987 and 2007.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2007

Cuppability of Simple and Hypersimple Sets.

Martin Kummer, Marcus Schäfer

Notre Dame J. Formal Log., 2007

2000

The Comlexity of Odd^A_n.

Richard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy H. McNicholl, Frank Stephan

J. Symb. Log., 2000

1999

A Unified Approach to Linear and Nonlinear Normal Forms for Hamiltonian Systems.

Richard C. Churchill, Martin Kummer

J. Symb. Comput., 1999

1998

On the Relative Sizes of Learnable Sets.

Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan

Theor. Comput. Sci., 1998

1997

Learning Recursive Functions from Approximations.

John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer

J. Comput. Syst. Sci., 1997

1996

On Resource-Bounded Instance Complexity.

Lance Fortnow, Martin Kummer

Theor. Comput. Sci., 1996

Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets.

Martin Kummer

SIAM J. Comput., 1996

Inclusion Problems in Parallel Learning and Games.

Martin Kummer, Frank Stephan

J. Comput. Syst. Sci., 1996

On the Structure of Degrees of Inferability.

Martin Kummer, Frank Stephan

J. Comput. Syst. Sci., 1996

On a Quantitative Notion of Uniformity.

Susanne Kaufmann, Martin Kummer

Fundam. Informaticae, 1996

On the Complexity of Random Strings (Extended Abstract).

Martin Kummer

Proceedings of the STACS 96, 1996

On the Query Complexity of Sets.

Richard Beigel, William I. Gasarch, Martin Kummer, Timothy H. McNicholl, Frank Stephan

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Learning Branches and Learning to Win Closed Games.

Martin Kummer, Matthias Ott

Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

1995

Approximable Sets

Richard Beigel, Martin Kummer, Frank Stephan

Inf. Comput., August, 1995

Recursion Theoretic Properties of Frequency Computation and Bounded Queries

Martin Kummer, Frank Stephan

Inf. Comput., July, 1995

Quantifying the Amount of Verboseness

Richard Beigel, Martin Kummer, Frank Stephan

Inf. Comput., April, 1995

A Learning-Theoretic Characterization of Classes of Recursive Functions.

Martin Kummer

Inf. Process. Lett., 1995

Computability of Convex Sets (Extended Abstract).

Martin Kummer, Marcus Schäfer

Proceedings of the STACS 95, 1995

Resource-Bounded Instance Complexity (Extended Abstract).

Lance Fortnow, Martin Kummer

Proceedings of the STACS 95, 1995

Measure, Category and Learning Theory.

Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

The Power of Frequency Computation (Extended Abstract).

Martin Kummer, Frank Stephan

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Effective Strategies for Enumeration Games.

Martin Kummer, Matthias Ott

Proceedings of the Computer Science Logic, 9th International Workshop, 1995

The Instance Complexity Conjecture.

Martin Kummer

Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1994

Effective Search Problems.

Frank Stephan, Martin Kummer

Math. Log. Q., 1994

Herbrand's Theorem for Nonstandard Inference Operations.

Jürgen Dix, Martin Kummer

J. Log. Comput., 1994

Diagonals and D-Maximal Sets.

Eberhard Herrmann, Martin Kummer

J. Symb. Log., 1994

Extremes in the Degrees of Inferability.

Lance Fortnow, William I. Gasarch, Sanjay Jain, Efim B. Kinber, Martin Kummer, Stuart A. Kurtz, Mark Pleszkovich, Theodore A. Slaman, Robert Solovay, Frank Stephan

Ann. Pure Appl. Log., 1994

Inclusion Problems in Parallel Learning and Games (Extended Abstract).

Martin Kummer, Frank Stephan

Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

The Strength of Noninclusions for Teams of Finite Learners (Extended Abstract).

Martin Kummer

Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

1993

Herbrand's Theorem for Nonstandard Inference Operations (Abstract).

Jürgen Dix, Martin Kummer

J. Symb. Log., 1993

Weakly Semirecursive Sets and r.e. Orderings.

Martin Kummer, Frank Stephan

Ann. Pure Appl. Log., 1993

Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract).

Martin Kummer, Frank Stephan

Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1992

A Proof of Beigel's Cardinality Conjecture.

Martin Kummer

J. Symb. Log., 1992

Frequency Computations and the Cardinality Theorem.

Valentina S. Harizanov, Martin Kummer, James C. Owings

J. Symb. Log., 1992

Degrees of Unsolvability in Abstract Complexity Theory.

Martin Kummer

Proceedings of the Complexity Theory: Current Research, 1992

Degrees of Inferability.

Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

Diagonals and Semihyperhypersimple Sets.

Martin Kummer

J. Symb. Log., 1991

1990

An Easy Priority-Free Proof of a Theorem of Friedberg.

Martin Kummer

Theor. Comput. Sci., 1990

Some applications of computable one-one numberings.

Martin Kummer

Arch. Math. Log., 1990

1989

Beiträge zur Theorie der Numerierungen: eindeutige Numerierungen.

Martin Kummer

PhD thesis, 1989

A Note on Direct Sums of Friedbergnumberings.

Martin Kummer

J. Symb. Log., 1989

1988

The Length Problem for Co-R.E. Sets.

Martin Kummer

Math. Log. Q., 1988

Numberings of R₁ union F.

Martin Kummer

Proceedings of the CSL '88, 1988

1987

Negative Results about the Length Problem.

Martin Kummer

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987