Complexity properties of recursively enumerable sets and bsQ-completeness
From MaRDI portal
Publication:5942014
DOI10.1007/BF02676727zbMATH Open1017.03020OpenAlexW4254549838MaRDI QIDQ5942014FDOQ5942014
Authors: Roland Sh. Omanadze 
Publication date: 4 March 2003
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02676727
Recommendations
- Complexity properties of recursively enumerable sets and \(sQ\)-completeness
- scientific article; zbMATH DE number 1138314
- On \(sQ\)-completeness of recursively enumerable sets
- DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY
- Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
- scientific article; zbMATH DE number 3914303
- scientific article; zbMATH DE number 3896921
- Kolmogorov complexity and computably enumerable sets
- Computably enumerable sets and quasi-reducibility
- Complete sets and closeness to complexity classes
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Title not available (Why is that?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Reducibility and Completeness for Sets of Integers
- On subcreative sets and S-reducibility
- ON WAYS OF CHARACTERIZING COMPLETE SETS
- Title not available (Why is that?)
- On complexity properties of recursively enumerable sets
- Complexity properties of recursively enumerable sets and \(sQ\)-completeness
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Complexity properties of recursively enumerable sets and \(bsQ\)-completeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5942014)
