John G. Geske

According to our database, John G. Geske authored at least 5 papers between 1986 and 1991.

Collaborative distances:

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

1991

A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes

John G. Geske, Dung T. Huynh, Joel I. Seiferas

Inf. Comput., May, 1991

1990

Almost-Everywhere Complexity, Bi-Immunity and Nondeterministic Space.

John G. Geske, Diane Kakihara

Proceedings of the Advances in Computing and Information, 1990

1987

On the structure of intractable sets.

John G. Geske

PhD thesis, 1987

A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees.

John G. Geske, Dung T. Huynh, Alan L. Selman

Proceedings of the STACS 87, 1987

1986

Relativizations of Unambiguous and Random Polynomial Time Classes.

John G. Geske, Joachim Grollmann

SIAM J. Comput., 1986