Skip to main content


eCommons@Cornell >

Browsing by Author Kadin, Jim

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 1 to 8 of 8
PreviewIssue DateTitleAuthor(s)
May-1989The Boolean Hierarchy and the Polynomial Hierarchy: a Closer ConnectionChang, Richard; Kadin, Jim
Aug-1986Deterministic Polynomial Time O(log n) QueriesKadin, Jim
Jun-1987Is One NP Question as Powerful as Two?Kadin, Jim
Aug-1981A Note on the Complexity of Goedel Numberings and IsomorphismsKadin, Jim
May-1990On Computing Boolean Connectives of Characteristic FunctionsChang, Richard; Kadin, Jim
May-1990On the Structure of Uniquely Satisfiable FormulasChang, Richard; Kadin, Jim
Jun-1987The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy CollapsesKadin, Jim
Mar-1988Restricted Turing Reducibilities and the Structure of the Polynomial Time HierarchyKadin, Jim
Showing results 1 to 8 of 8


© 2014 Cornell University Library Contact Us