Structural Properties of Nonautoreducible Sets

DOI10.1145/2898440zbMath1427.68098OpenAlexW2385562929WikidataQ130955202 ScholiaQ130955202MaRDI QIDQ4973856

Selman, Alan L., Dung Tien Nguyen

Publication date: 6 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2898440

zbMATH Keywords

diagonalizationstructural complexityNEXPautoreducibility

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other degrees and reducibilities in computability and recursion theory (03D30)

This page was built for publication: Structural Properties of Nonautoreducible Sets