On polynomially D verbose sets

DOI10.1007/BFb0023468zbMath1498.68118OpenAlexW1517540643MaRDI QIDQ5048933

Arfst Nickelsen

Publication date: 9 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (1)

Time bounded frequency computations

Cites Work

• A proof of Beigel's cardinality conjecture
• Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
• Semirecursive Sets and Positive Reducibility
• Unnamed Item
• Unnamed Item

This page was built for publication: On polynomially D verbose sets