Jim Kadin
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Functions computable with nonadaptive queries to NP Theory of Computing Systems | 1998-08-24 | Paper |
| The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection SIAM Journal on Computing | 1996-09-05 | Paper |
| On unique satisfiability and the threshold behavior of randomized reductions Journal of Computer and System Sciences | 1995-08-21 | Paper |
| On computing Boolean connectives of characteristic functions Mathematical Systems Theory | 1995-06-08 | Paper |
| Erratum: The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses SIAM Journal on Computing | 1992-06-25 | Paper |
| \(P^{NP[O(\log n)}\) and sparse turing-complete sets for NP] Journal of Computer and System Sciences | 1989-01-01 | Paper |
| The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses SIAM Journal on Computing | 1988-01-01 | Paper |
Research outcomes over time
This page was built for person: Jim Kadin
