On the power of unambiguity in log-space (Q1926109)

From MaRDI portal
Revision as of 12:30, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56689209, #quickstatements; #temporary_batch_1712201099914)
scientific article
Language Label Description Also known as
English
On the power of unambiguity in log-space
scientific article

    Statements

    title
    On the power of unambiguity in log-space (English)
    0 references
    author
    A. Pavan
    0 references
    Raghunath Tewari
    0 references
    N. V. Vinodchandran
    0 references
    publication date
    27 December 2012
    0 references
    Mathematics Subject Classification ID
    68Q15
    0 references
    68Q17
    0 references
    68Q05
    0 references
    68Q10
    0 references
    zbMATH DE Number
    6118606
    0 references
    zbMATH Keywords
    log-space complexity
    0 references
    unambiguous computations
    0 references
    graph reachability
    0 references
    log-space optimization
    0 references
    hardness
    0 references
    OpenAlex ID
    W1772007397
    0 references
    Wikidata QID
    Q56689209
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1926109&oldid=33236671"
    Powered by MediaWiki