P-Printable Sets (Q4732106)

From MaRDI portal
Revision as of 14:42, 3 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 4117842
Language Label Description Also known as
English
P-Printable Sets
scientific article; zbMATH DE number 4117842

    Statements

    title
    P-Printable Sets (English)
    0 references
    author
    Eric W. Allender
    0 references
    Roy S. Rubinstein
    0 references
    publication date
    1988
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    data compression
    0 references
    sparse sets
    0 references
    P-isomorphisms
    0 references
    AuxPDAs
    0 references
    Kolmogorov complexity
    0 references
    tally language
    0 references

    Identifiers

    DOI
    10.1137/0217075
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q05
    0 references
    03D15
    0 references
    03D30
    0 references
    zbMATH DE Number
    4117842
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4732106&oldid=9196909"
      Powered by MediaWiki