![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 9 | Richard Chang, Jim Kadin: The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection. SIAM J. Comput. 25(2): 340-354 (1996) | |
| 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) | |
| 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 | |
| 3 | Richard Chang, Jim Kadin: The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection. Structure in Complexity Theory Conference 1990: 169-178 |
Selection of 5 from 10 records - Jim Kadin has 4 coauthors
Copyright © 2009-12-24 by Michael Ley (ley@uni-trier.de)