Resource bounded frequency computations with three errors (Q848951): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-009-9330-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074473195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2742600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural property of regular frequency computations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frequency computation and bounded queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frequency computations and the cardinality theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounded frequency computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5680113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Beigel's cardinality conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion theoretic properties of frequency computation and bounded queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Automata, a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of a theorem of margaris / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708609 / rank
 
Normal rank

Latest revision as of 12:16, 2 July 2024

scientific article
Language Label Description Also known as
English
Resource bounded frequency computations with three errors
scientific article

    Statements

    Resource bounded frequency computations with three errors (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2010
    0 references
    0 references
    frequency computations
    0 references
    complexity
    0 references
    algorithms
    0 references
    polynomial time
    0 references
    0 references