Automating Resolution is NP-Hard (Q5133983)

From MaRDI portal
Revision as of 13:01, 16 December 2024 by Import241212081232 (talk | contribs) (Add wikidata reference.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 7273098
Language Label Description Also known as
English
Automating Resolution is NP-Hard
scientific article; zbMATH DE number 7273098

    Statements

    title
    Automating Resolution is NP-Hard (English)
    0 references
    author
    Albert Atserias
    0 references
    Moritz Müller
    0 references
    publication date
    11 November 2020
    0 references
    zbMATH Keywords
    NP-hardness
    0 references
    proof search
    0 references
    resolution
    0 references

    Identifiers

    DOI
    10.1145/3409472
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    03B35
    0 references
    03F20
    0 references
    zbMATH DE Number
    7273098
    0 references
    OpenAlex ID
    W3081705035
    0 references
    arXiv ID
    1904.02991
    0 references
    Wikidata QID
    Q130964099
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5133983&oldid=38790749"
    Powered by MediaWiki