Resource bounded frequency computations with three errors

DOI10.1007/S00453-009-9330-3zbMATH Open1187.68262OpenAlexW2074473195MaRDI QIDQ848951FDOQ848951

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

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

zbMATH Keywords

algorithmscomplexitypolynomial timefrequency computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Frequency computation and bounded queries
• The Theory of Automata, a Survey
• A proof of Beigel's cardinality conjecture
• Frequency computations and the cardinality theorem
• Time bounded frequency computations
• A structural property of regular frequency computations.
• Recursion theoretic properties of frequency computation and bounded queries
• Regular frequency computations
• An extension of a theorem of margaris
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

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

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)