The structure of generalized complexity cores
From MaRDI portal
Publication:1115611
DOI10.1016/0304-3975(88)90119-3zbMath0664.68051WikidataQ126436595 ScholiaQ126436595MaRDI QIDQ1115611
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90119-3
68Q25: Analysis of algorithms and problem complexity
03D15: Complexity of computation (including implicit computational complexity)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A classification of complexity core lattices
- Bi-immune sets for complexity classes
- Nonlevelable sets and immune sets in the accepting density hierarchy inNP
- The density and complexity of polynomial cores for intractable sets
- Optimal Approximations and Polynomially Levelable Sets
- OnP-subset structures
- Completeness, Approximation and Density
- On Reducibility to Complex or Sparse Sets
- On complexity properties of recursively enumerable sets