| 1998 |
|---|
| 10 | | Harry Buhrman,
Jim Kadin,
Thomas Thierauf:
Functions Computable with Nonadaptive Queries to NP.
Theory Comput. Syst. 31(1): 77-92 (1998) |
| 1996 |
|---|
| 9 | | Richard Chang,
Jim Kadin:
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection.
SIAM J. Comput. 25(2): 340-354 (1996) |
| 1995 |
|---|
| 8 | | Richard Chang,
Jim Kadin,
Pankaj Rohatgi:
On Unique Satisfiability and the Threshold Behavior of Randomized Reductions.
J. Comput. Syst. Sci. 50(3): 359-373 (1995) |
| 7 | | Richard Chang,
Jim Kadin:
On Computing Boolean Connectives of Characteristic Functions.
Mathematical Systems Theory 28(3): 173-198 (1995) |
| 1994 |
|---|
| 6 | | Harry Buhrman,
Jim Kadin,
Thomas Thierauf:
On Functions Computable with Nonadaptive Queries to NP.
Structure in Complexity Theory Conference 1994: 43-52 |
| 1991 |
|---|
| 5 | | Richard Chang,
Jim Kadin,
Pankaj Rohatgi:
Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions.
Structure in Complexity Theory Conference 1991: 255-269 |
| 4 | | Jim Kadin:
Erratum: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses.
SIAM J. Comput. 20(2): 404 (1991) |
| 1990 |
|---|
| 3 | | Richard Chang,
Jim Kadin:
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection.
Structure in Complexity Theory Conference 1990: 169-178 |
| 1989 |
|---|
| 2 | | Jim Kadin:
P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP.
J. Comput. Syst. Sci. 39(3): 282-298 (1989) |
| 1988 |
|---|
| 1 | | Jim Kadin:
The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses.
SIAM J. Comput. 17(6): 1263-1282 (1988) |
