On Nondeterminism, Enumeration Reducibility and Polynomial Bounds

Mathematical Logic Quarterly 43 (3):287-310 (1997)

Abstract This article has no associated abstract. (fix it)
Keywords Conjunctive reducibility  Relative computability  Complexity class  Enumeration degrees  Polynomial time reducibility  Polynomial time degree  Enumeration reducibility  Non‐determinism  Polynomial enumeration
Categories (categorize this paper)
DOI 10.1002/malq.19970430302
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 40,683
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2013-11-03

Total views
16 ( #500,048 of 2,242,823 )

Recent downloads (6 months)
10 ( #128,478 of 2,242,823 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature