Jim Kadin

14 papers Journal 7Unranked 5
YearRankTypeTitle / Venue / Authors
1998 J jnl
Functions Computable with Nonadaptive Queries to NP.
Theory Comput. Syst.
Harry Buhrman, Jim Kadin, Thomas Thierauf
1996 J jnl
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection.
SIAM J. Comput.
Richard Chang, Jim Kadin
1995 J jnl
On Computing Boolean Connectives of Characteristic Functions.
Math. Syst. Theory
Richard Chang, Jim Kadin
1995 J jnl
On Unique Satisfiability and the Threshold Behavior of Randomized Reductions.
J. Comput. Syst. Sci.
Richard Chang, Jim Kadin, Pankaj Rohatgi
1994 — conf
On Functions Computable with Nonadaptive Queries to NP.
SCT
Harry Buhrman, Jim Kadin, Thomas Thierauf
1993 — ch.
Some Observations about Relativization of Space Bounded Computations.
Current Trends in Theoretical Computer Science
Juris Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell
1991 — conf
Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions.
SCT
Richard Chang, Jim Kadin, Pankaj Rohatgi
1991 J jnl
Erratum: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses.
SIAM J. Comput.
Jim Kadin
1990 — conf
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection.
SCT
Richard Chang, Jim Kadin
1989 J jnl
P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP.
J. Comput. Syst. Sci.
Jim Kadin
1988 — —
Restricted Turing Reducibilities & the Structure of the Polynomial Time Hierarchy.
Jim Kadin
1988 J jnl
The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses.
SIAM J. Comput.
Jim Kadin
1988 — conf
The polynomial time hierarchy collapses if the Boolean hierarchy collapses.
SCT
Jim Kadin
1987 — conf
P
SCT
Jim Kadin