Computing roots of graphs is hard (Q1336641)

From MaRDI portal
Revision as of 10:10, 23 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing roots of graphs is hard
scientific article

    Statements

    title
    Computing roots of graphs is hard (English)
    0 references
    author
    Rajeev Motwani
    0 references
    Madhu Sudan
    0 references
    publication date
    3 November 1994
    0 references
    zbMATH Keywords
    undirected graph
    0 references

    Identifiers

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