Computing roots of graphs is hard (Q1336641)

From MaRDI portal
Revision as of 13:05, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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=13463908"
    Powered by MediaWiki