Resource bounded frequency computations with three errors

DOI10.1007/S00453-009-9330-3MaRDI QIDQ848951zbMATH OpenOpenAlexFDO

Authors Ulrich Hertrampf, Christoph Minnameier

Publication date 23 February 2010

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-009-9330-3

zbMATH Keywords

algorithmscomplexitypolynomial timefrequency computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Resource Bounded Frequency Computations with Three Errors
• Time bounded frequency computations
• scientific article; zbMATH DE number 1346358
• Frequency computation and bounded queries
• The power of frequency computation

Cites work

• scientific article; zbMATH DE number 3851063 (Why is no real title available?)
• scientific article; zbMATH DE number 1929974 (Why is no real title available?)
• scientific article; zbMATH DE number 3415833 (Why is no real title available?)
• A proof of Beigel's cardinality conjecture
• A structural property of regular frequency computations.
• An extension of a theorem of margaris
• Frequency computation and bounded queries
• Frequency computations and the cardinality theorem
• Recursion theoretic properties of frequency computation and bounded queries
• Regular frequency computations
• The Theory of Automata, a Survey
• Time bounded frequency computations

Cited in

(2)

• Resource Bounded Frequency Computations with Three Errors
• Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds

This page was built for publication: Resource bounded frequency computations with three errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848951)