Jim Kadin
From MaRDI portal
Person:908699
Available identifiers
zbMath Open kadin.jimMaRDI QIDQ908699
List of research outcomes
Publication | Date of Publication | Type |
---|---|---|
Functions computable with nonadaptive queries to NP | 1998-08-24 | Paper |
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection | 1996-09-05 | Paper |
On unique satisfiability and the threshold behavior of randomized reductions | 1995-08-21 | Paper |
On computing Boolean connectives of characteristic functions | 1995-06-08 | Paper |
Erratum: The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses | 1992-06-25 | Paper |
\(P^{NP[O(\log n)}\) and sparse turing-complete sets for NP] | 1989-01-01 | Paper |
The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses | 1988-01-01 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
Property | Value |
---|---|
MaRDI profile type | MaRDI person profile |
instance of | human |
This page was built for person: Jim Kadin