On the complexity of circuit satisfiability (Q2875150)

From MaRDI portal
Revision as of 00:44, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of circuit satisfiability
scientific article

    Statements

    title
    On the complexity of circuit satisfiability (English)
    0 references
    author
    Ramamohan Paturi
    0 references
    Pavel Pudlák
    0 references
    publication date
    13 August 2014
    0 references
    zbMATH Keywords
    NP-completeness
    0 references
    circuit satisfiability
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q15
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6330063
    0 references
    OpenAlex ID
    W2090871895
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2875150&oldid=32650682"
    Powered by MediaWiki