An arithmetical characterization of NP (Q1171050): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3247126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Product of the Primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bounded arithmetic hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank

Latest revision as of 16:17, 13 June 2024

scientific article
Language Label Description Also known as
English
An arithmetical characterization of NP
scientific article

    Statements

    An arithmetical characterization of NP (English)
    0 references
    0 references
    0 references
    1982
    0 references
    non-deterministic computability
    0 references
    arithmetical representability
    0 references
    non- deterministic Turing machine
    0 references
    universal quantifiers
    0 references
    existential quantifiers
    0 references
    quantifier prefix
    0 references

    Identifiers