Recommendations
Cites work
- scientific article; zbMATH DE number 3851063 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3523527 (Why is no real title available?)
- scientific article; zbMATH DE number 512828 (Why is no real title available?)
- scientific article; zbMATH DE number 3304976 (Why is no real title available?)
- Approximable sets
- On polynomially \(\mathcal{D}\)-verbose sets
- On self-reducibility and weak P-selectivity
- On the Structure of Polynomial Time Reducibility
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
- Polynomial terse sets
- Polynomial-Time Membership Comparable Sets
- Semirecursive Sets and Positive Reducibility
- Some connections between bounded query classes and non-uniform complexity.
- The Theory of Automata, a Survey
- The power of frequency computation
Cited in
(10)- Frequency computations and the cardinality theorem
- Resource Bounded Frequency Computations with Three Errors
- The power of frequency computation
- One query reducibilities between partial information classes
- Regular frequency computations
- A structural property of regular frequency computations.
- Structured Frequency Algorithms
- On the influence of technology on learning processes
- The value of help bits in randomized and average-case complexity
- Resource bounded frequency computations with three errors
This page was built for publication: Time bounded frequency computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383147)
