On polynomially D-verbose sets

DOI10.1007/BFB0023468MaRDI QIDQ5048933zbMATH OpenOpenAlexFDO

Authors 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 classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• scientific article; zbMATH DE number 1834678
• Recursion theoretic properties of frequency computation and bounded queries
• scientific article; zbMATH DE number 1361501
• Complete sets and closeness to complexity classes
• scientific article; zbMATH DE number 517081

Cites work

• scientific article; zbMATH DE number 6084400 (Why is no real title available?)
• scientific article; zbMATH DE number 512828 (Why is no real title available?)
• 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

Cited in

(4)

• scientific article; zbMATH DE number 1834678 (Why is no real title available?)
• Time bounded frequency computations
• Comparing verboseness for finite automata and Turing machines
• Quantifying the amount of verboseness

This page was built for publication: On polynomially \(\mathcal{D}\)-verbose sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048933)