Остановите войну!
for scientists:
default search action
Jim Kadin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
- [j7]Harry Buhrman, Jim Kadin, Thomas Thierauf:
Functions Computable with Nonadaptive Queries to NP. Theory Comput. Syst. 31(1): 77-92 (1998) - 1996
- [j6]Richard Chang, Jim Kadin:
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection. SIAM J. Comput. 25(2): 340-354 (1996) - 1995
- [j5]Richard Chang, Jim Kadin, Pankaj Rohatgi:
On Unique Satisfiability and the Threshold Behavior of Randomized Reductions. J. Comput. Syst. Sci. 50(3): 359-373 (1995) - [j4]Richard Chang, Jim Kadin:
On Computing Boolean Connectives of Characteristic Functions. Math. Syst. Theory 28(3): 173-198 (1995) - 1994
- [c5]Harry Buhrman, Jim Kadin, Thomas Thierauf:
On Functions Computable with Nonadaptive Queries to NP. SCT 1994: 43-52 - 1993
- [p1]Juris Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell:
Some Observations about Relativization of Space Bounded Computations. Current Trends in Theoretical Computer Science 1993: 423-434 - 1991
- [j3]Jim Kadin:
Erratum: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. SIAM J. Comput. 20(2): 404 (1991) - [c4]Richard Chang, Jim Kadin, Pankaj Rohatgi:
Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions. SCT 1991: 255-269 - 1990
- [c3]Richard Chang, Jim Kadin:
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection. SCT 1990: 169-178
1980 – 1989
- 1989
- [j2]Jim Kadin:
P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP. J. Comput. Syst. Sci. 39(3): 282-298 (1989) - 1988
- [b1]Jim Kadin:
Restricted Turing Reducibilities & the Structure of the Polynomial Time Hierarchy. Cornell University, USA, 1988 - [j1]Jim Kadin:
The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. SIAM J. Comput. 17(6): 1263-1282 (1988) - [c2]Jim Kadin:
The polynomial time hierarchy collapses if the Boolean hierarchy collapses. SCT 1988: 278-292 - 1987
- [c1]Jim Kadin:
PNP[log n] and sparse turing complete sets for NP. SCT 1987: 33-40
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint