- CSB - MetaPress - Google - Bing - Yahoo
 | 1998 | |
|---|---|---|
| j7 |      | Harry Buhrman, Jim Kadin, Thomas Thierauf: Functions Computable with Nonadaptive Queries to NP. Theory Comput. Syst. 31(1): 77-92 (1998) |
| 1996 | ||
| j6 | | Richard Chang, Jim Kadin: The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection. SIAM J. Comput. 25(2): 340-354 (1996) |
| 1995 | ||
| j5 | | 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) |
| j4 | | Richard Chang, Jim Kadin: On Computing Boolean Connectives of Characteristic Functions. Mathematical Systems Theory 28(3): 173-198 (1995) |
| 1994 | ||
| c5 | | Harry Buhrman, Jim Kadin, Thomas Thierauf: On Functions Computable with Nonadaptive Queries to NP. Structure in Complexity Theory Conference 1994: 43-52 |
| 1991 | ||
| j3 | | Jim Kadin: Erratum: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. SIAM J. Comput. 20(2): 404 (1991) |
| c4 | | 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 |
| 1990 | ||
| c3 | | Richard Chang, Jim Kadin: The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection. Structure in Complexity Theory Conference 1990: 169-178 |
| 1989 | ||
| j2 | | Jim Kadin: P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP. J. Comput. Syst. Sci. 39(3): 282-298 (1989) |
| 1988 | ||
| j1 | | Jim Kadin: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. SIAM J. Comput. 17(6): 1263-1282 (1988) |
| c2 | | Jim Kadin: The polynomial time hierarchy collapses if the Boolean hierarchy collapses. Structure in Complexity Theory Conference 1988: 278-292 |
| 1987 | ||
| c1 |  | Jim Kadin: PNP[log n] and sparse turing complete sets for NP. Structure in Complexity Theory Conference 1987 |
| 1 | Harry Buhrman | |
| 2 | Richard Chang | |
| 3 | Pankaj Rohatgi | |
| 4 | Thomas Thierauf |
Data released under the ODC-BY 1.0 license — See also our legal information page