( en | de | ru )

 

Disambiguation of "Kadin, Jim"

Author of the publication

copydeleteadd this publication to your clipboard
On Functions Computable with Nonadaptive Queries to NP.

, , and . Computational Complexity Conference, page 43-52. IEEE Computer Society, (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kadin Karakaya

jim halo

Jim Wilenius

Jim Kallarackal

Jim Tsen

 

Other publications of authors with the same name

P^(NPO(log n)) and Sparse Turing-Complete Sets for NP.. J. Comput. Syst. Sci., 39 (3): 282-298 (1989)The polynomial time hierarchy collapses if the Boolean hierarchy collapses.. SCT, page 278-292. IEEE Computer Society, (1988)Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions., , and . SCT, page 255-269. IEEE Computer Society, (1991)On Computing Boolean Connectives of Characteristic Functions., and . Math. Syst. Theory, 28 (3): 173-198 (1995)On Unique Satisfiability and the Threshold Behavior of Randomized Reductions., , and . J. Comput. Syst. Sci., 50 (3): 359-373 (1995)The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection., and . SCT, page 169-178. IEEE Computer Society, (1990)PNPlog n and sparse turing complete sets for NP.. SCT, page 33-40. IEEE Computer Society, (1987)The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection., and . SIAM J. Comput., 25 (2): 340-354 (1996)Some Observations about Relativization of Space Bounded Computations., , , and . Current Trends in Theoretical Computer Science, volume 40 of World Scientific Series in Computer Science, World Scientific, (1993)Erratum: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses.. SIAM J. Comput., 20 (2): 404 (1991)see: SIAM J. Comput. 17(6): 1263-1282 (1988).