Jim Kadin

According to our database, Jim Kadin authored at least 11 papers between 1987 and 1998.

Collaborative distances:

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

1998

Functions Computable with Nonadaptive Queries to NP.

Harry Buhrman, Jim Kadin, Thomas Thierauf

Theory Comput. Syst., 1998

1996

The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection.

Richard Chang, Jim Kadin

SIAM J. Comput., 1996

1995

On Computing Boolean Connectives of Characteristic Functions.

Richard Chang, Jim Kadin

Math. Syst. Theory, 1995

On Unique Satisfiability and the Threshold Behavior of Randomized Reductions.

Richard Chang, Jim Kadin, Pankaj Rohatgi

J. Comput. Syst. Sci., 1995

1993

Some Observations about Relativization of Space Bounded Computations.

Juris Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

1991

Erratum: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses.

Jim Kadin

SIAM J. Comput., 1991

Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions.

Richard Chang, Jim Kadin, Pankaj Rohatgi

Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

1989

P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP.

Jim Kadin

J. Comput. Syst. Sci., 1989

1988

Restricted Turing Reducibilities & the Structure of the Polynomial Time Hierarchy.

Jim Kadin

PhD thesis, 1988

The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses.

Jim Kadin

SIAM J. Comput., 1988

1987

P^NP[log n] and sparse turing complete sets for NP.

Jim Kadin

Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987