Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Jim Kadin" ( http://dblp.L3S.de/Authors/Jim_Kadin )

  Author page on DBLP  Author page in RDF  Community of Jim Kadin in ASPL-2

Publication years (Num. hits)
1988-1998 (10)
Publication types (Num. hits)
article(7) inproceedings(3)
Venues (Conferences, Journals, ...)
SIAM J. Comput.(3) Structure in Complexity Theory...(3) J. Comput. Syst. Sci.(2) Mathematical Systems Theory(1) Theory Comput. Syst.(1)
Authors
Jim Kadin(10) Richard Chang(5) Harry Buhrman(2) Pankaj Rohatgi(2) Thomas Thierauf(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 10 publication records. Showing 10 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Harry Buhrman, Jim Kadin, Thomas Thierauf Functions Computable with Nonadaptive Queries to NP. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Richard Chang, Jim Kadin The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Richard Chang, Jim Kadin On Computing Boolean Connectives of Characteristic Functions. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Richard Chang, Jim Kadin, Pankaj Rohatgi On Unique Satisfiability and the Threshold Behavior of Randomized Reductions. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Jim Kadin, Thomas Thierauf On Functions Computable with Nonadaptive Queries to NP. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1994 DBLP  BibTeX  RDF
1Jim Kadin Erratum: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Richard Chang, Jim Kadin, Pankaj Rohatgi Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1991 DBLP  BibTeX  RDF
1Richard Chang, Jim Kadin The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1990 DBLP  BibTeX  RDF
1Jim Kadin P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Jim Kadin The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #10 of 10 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.