The power of frequency computation

DOI10.1007/3-540-60249-6_64OpenAlexW1692574363MaRDI QIDQ5055904

No author found.

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (3)

Learning recursive functions from approximations ⋮ Time bounded frequency computations ⋮ Resource Bounded Frequency Computations with Three Errors

Cites Work

• Bi-immunity results for cheatable sets
• Polynomial terse sets
• Bounded queries to SAT and the Boolean hierarchy
• Learning recursive functions from approximations
• Terse, superterse, and verbose sets
• On learning multiple concepts in parallel
• A proof of Beigel's cardinality conjecture
• Frequency computations and the cardinality theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The power of frequency computation