Unrestricted resolution versus N-resolution (Q1185013)

From MaRDI portal
Revision as of 21:09, 11 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126352572, #quickstatements; #temporary_batch_1718132803760)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Unrestricted resolution versus N-resolution
scientific article

    Statements

    title
    Unrestricted resolution versus N-resolution (English)
    0 references
    author
    Andreas Goerdt
    0 references
    publication date
    28 June 1992
    0 references
    zbMATH DE Number
    35442
    0 references
    zbMATH Keywords
    complexity of proof systems
    0 references
    restriction
    0 references
    theorem-proving algorithms
    0 references
    \(N\)-resolution
    0 references
    OpenAlex ID
    W2076663305
    0 references
    Wikidata QID
    Q126352572
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1185013&oldid=34507289"
    Powered by MediaWiki