Classification of the index sets of low \([n]^ p\) and high \([n]^ p\)

DOI10.1007/BF02945518zbMath0821.68058OpenAlexW2051935005MaRDI QIDQ1337641

Yuefei Sui

Publication date: 19 September 1995

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02945518

zbMATH Keywords

index setspolynomial enumerable sets

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• A hierarchy for nondeterministic time complexity
• Alternation
• Computational complexity, speedable and levelable sets
• The NP-completeness column: An ongoing guide
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Classification of the index sets of low \([n]^ p\) and high \([n]^ p\)