Degrees and reducibilities of easy tally sets

DOI10.1007/3-540-58338-6_87zbMath1493.68150OpenAlexW1517491096MaRDI QIDQ5096899

Montserrat Hermo

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_87

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

The structure of logarithmic advice complexity classes

Cites Work

• Kolmogorov complexity and degrees of tally sets
• Continuous optimization problems and a polynomial hierarchy of real functions
• On helping by robust oracle machines
• Logarithmic advice classes
• The structure of logarithmic advice complexity classes
• Sets with small generalized Kolmogorov complexity
• Reducibilities on tally and sparse sets
• On Sets Truth-Table Reducible to Sparse Sets
• P-Printable Sets
• Unnamed Item
• Unnamed Item

This page was built for publication: Degrees and reducibilities of easy tally sets