Time bounded frequency computations

DOI10.1006/inco.1997.2666zbMath0892.68032OpenAlexW2029293245MaRDI QIDQ1383147

Maren Hinrichs, Gerd Wechsung

Publication date: 27 July 1998

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1997.2666

zbMATH Keywords

polynomial time frequency classesselectivity classes

Mathematics Subject Classification ID

Related Items

On the Influence of Technology on Learning Processes ⋮ Resource bounded frequency computations with three errors ⋮ Structured Frequency Algorithms ⋮ Resource Bounded Frequency Computations with Three Errors ⋮ Regular frequency computations ⋮ The value of help bits in randomized and average-case complexity ⋮ One query reducibilities between partial information classes ⋮ A structural property of regular frequency computations.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On self-reducibility and weak P-selectivity
• Polynomial terse sets
• Some connections between bounded query classes and non-uniform complexity.
• Approximable sets
• On the Structure of Polynomial Time Reducibility
• P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
• Polynomial-Time Membership Comparable Sets
• On polynomially D verbose sets
• The power of frequency computation
• The Theory of Automata, a Survey
• Semirecursive Sets and Positive Reducibility