Nondeterministic polynomial-time computations and models of arithmetic (Q3476273)

From MaRDI portal
Revision as of 02:51, 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
Nondeterministic polynomial-time computations and models of arithmetic
scientific article

    Statements

    Nondeterministic polynomial-time computations and models of arithmetic (English)
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computation by abstract devices
    0 references
    complexity classes
    0 references
    nondeterministic Turing machine
    0 references
    NP-complete
    0 references
    nonstandard models of arithmetic
    0 references
    diophantine sets
    0 references
    0 references