An NP-complete language accepted in linear time by a one-tape Turing machine (Q1183577)

From MaRDI portal
Revision as of 16:32, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An NP-complete language accepted in linear time by a one-tape Turing machine
scientific article

    Statements

    title
    An NP-complete language accepted in linear time by a one-tape Turing machine (English)
    0 references
    author
    Pascal Michel
    0 references
    publication date
    28 June 1992
    0 references
    zbMATH Keywords
    one-tape nondeterministic Turing machines
    0 references

    Identifiers

    zbMATH DE Number
    33396
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1183577&oldid=1495055"
      Powered by MediaWiki