Jim Kadin

Publication Activity (10 Years)

Years Active: 1987-1998
Publications (10 Years): 0

Publications

Harry Buhrman, Jim Kadin, Thomas Thierauf
Functions Computable with Nonadaptive Queries to NP. Theory Comput. Syst. 31 (1) (1998)
Richard Chang, Jim Kadin
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection. SIAM J. Comput. 25 (2) (1996)
Richard Chang, Jim Kadin, Pankaj Rohatgi
On Unique Satisfiability and the Threshold Behavior of Randomized Reductions. J. Comput. Syst. Sci. 50 (3) (1995)
Richard Chang, Jim Kadin
On Computing Boolean Connectives of Characteristic Functions. Math. Syst. Theory 28 (3) (1995)
Harry Buhrman, Jim Kadin, Thomas Thierauf
On Functions Computable with Nonadaptive Queries to NP. Computational Complexity Conference (1994)
Jim Kadin
Erratum: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. SIAM J. Comput. 20 (2) (1991)
Richard Chang, Jim Kadin, Pankaj Rohatgi
Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions. Computational Complexity Conference (1991)
Richard Chang, Jim Kadin
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection. Computational Complexity Conference (1990)
Jim Kadin
P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP. J. Comput. Syst. Sci. 39 (3) (1989)
Jim Kadin
The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. SIAM J. Comput. 17 (6) (1988)
Jim Kadin
The polynomial time hierarchy collapses if the Boolean hierarchy collapses. Computational Complexity Conference (1988)
Jim Kadin
[log n] and sparse turing complete sets for NP. Computational Complexity Conference (1987)