The structure of generalized complexity cores

DOI10.1016/0304-3975(88)90119-3zbMath0664.68051OpenAlexW2059922801WikidataQ126436595 ScholiaQ126436595MaRDI QIDQ1115611

Ronald V. Book, Ding-Zhu Du

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

zbMATH Keywords

structural complexitycomplexity coreslevelability

Mathematics Subject Classification ID

Related Items (1)

A classification of complexity core lattices

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

This page was built for publication: The structure of generalized complexity cores