|
eCommons@Cornell >
Browsing by Author Kadin, Jim
Showing results 1 to 8 of 8
| Preview | Issue Date | Title | Author(s) | | May-1989 | The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection | Chang, Richard; Kadin, Jim |
| Aug-1986 | Deterministic Polynomial Time O(log n) Queries | Kadin, Jim |
| Jun-1987 | Is One NP Question as Powerful as Two? | Kadin, Jim |
| Aug-1981 | A Note on the Complexity of Goedel Numberings and Isomorphisms | Kadin, Jim |
| May-1990 | On Computing Boolean Connectives of Characteristic Functions | Chang, Richard; Kadin, Jim |
| May-1990 | On the Structure of Uniquely Satisfiable Formulas | Chang, Richard; Kadin, Jim |
| Jun-1987 | The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses | Kadin, Jim |
| Mar-1988 | Restricted Turing Reducibilities and the Structure of the Polynomial Time Hierarchy | Kadin, Jim |
Showing results 1 to 8 of 8
|
