On complexity properties of recursively enumerable sets
From MaRDI portal
Publication:4101804
DOI10.2307/2271984zbMATH Open0335.02024OpenAlexW1975592766MaRDI QIDQ4101804FDOQ4101804
Authors: Ivan Marques, Manuel Blum 
Publication date: 1974
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2271984
Analysis of algorithms and problem complexity (68Q25) Recursively (computably) enumerable sets and degrees (03D25) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
Cited In (23)
- On \(bQ_1\)-degrees of c.e. sets
- Complexity properties of recursively enumerable sets and \(bsQ\)-completeness
- The complexity of total order structures
- The structure of generalized complexity cores
- On p-creative sets and p-completely creative sets
- \(sQ_1\)-degrees of computably enumerable sets
- Splitting theorems in recursion theory
- Complexity properties of recursively enumerable sets and \(sQ\)-completeness
- Title not available (Why is that?)
- Classes of recursively enumerable sets and Q-reducibility
- On computational complexity and honest polynomial degrees
- Kolmogorov entropy in the context of computability theory
- Upper semilattice of recursively enumerable Q-degrees
- Infimums of step-counting functions of enumeration of sets
- On speedable and levelable vector spaces
- On the bounded quasi‐degrees of c.e. sets
- Recursively enumerable sets and degrees
- Some reducibilities and splittings of recursively enumerable sets
- Upper semilattice of recursively enumerable sQ-degrees
- Lower bounds on degrees of game-theoretic structures
- Nonlevelable sets and immune sets in the accepting density hierarchy inNP
- Degree structures of conjunctive reducibility
- Some lowness properties and computational complexity sequences
This page was built for publication: On complexity properties of recursively enumerable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4101804)
