Complexity of algorithms and computations (Q1153141)

From MaRDI portal
Revision as of 07:59, 13 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q314212)
scientific article
Language Label Description Also known as
English
Complexity of algorithms and computations
scientific article

    Statements

    title
    Complexity of algorithms and computations (English)
    0 references
    author
    V. L. Matrosov
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    analytic classification
    0 references
    Turing machine
    0 references
    Markov algorithm
    0 references
    real time computation
    0 references
    hierarchies
    0 references

    Identifiers

    DOI
    10.1007/BF01084283
    0 references
    Mathematics Subject Classification ID
    03D15
    0 references
    68Q05
    0 references
    68W99
    0 references
    68Q25
    0 references
    68-02
    0 references
    03D25
    0 references
    03-02
    0 references
    zbMATH DE Number
    3722633
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1153141&oldid=20972280"
    Powered by MediaWiki