A complexity-theoretic proof of a Recursion-Theoretic Theorem
Abstract
References
- A complexity-theoretic proof of a Recursion-Theoretic Theorem
Recommendations
Recursion Theoretic Operators for Function Complexity Classes
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes based on recursive function theory and construct an operator which ...
On graph-theoretic lemmata and complexity classes
SFCS '90: Proceedings of the 31st Annual Symposium on Foundations of Computer ScienceSeveral new complexity classes of search problems that lie between the classes FP and FNP are defined. These classes are contained in the class TFNP of search problems that always have a solution. A problem in each of these new classes is defined in ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 193Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in