Time bounded frequency computations
From MaRDI portal
Publication:1383147
DOI10.1006/INCO.1997.2666zbMATH Open0892.68032OpenAlexW2029293245MaRDI QIDQ1383147FDOQ1383147
Authors: 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
Recommendations
Cites Work
- Approximable sets
- Title not available (Why is that?)
- 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
- Semirecursive Sets and Positive Reducibility
- On self-reducibility and weak P-selectivity
- Title not available (Why is that?)
- The Theory of Automata, a Survey
- Polynomial terse sets
- Title not available (Why is that?)
- Some connections between bounded query classes and non-uniform complexity.
- Title not available (Why is that?)
- The power of frequency computation
- Title not available (Why is that?)
- On polynomially \(\mathcal{D}\)-verbose sets
Cited In (10)
- One query reducibilities between partial information classes
- Resource bounded frequency computations with three errors
- The power of frequency computation
- A structural property of regular frequency computations.
- Structured Frequency Algorithms
- The value of help bits in randomized and average-case complexity
- Frequency computations and the cardinality theorem
- Resource Bounded Frequency Computations with Three Errors
- On the influence of technology on learning processes
- Regular frequency computations
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)
