Optimization problems and the polynomial hierarchy (Q1152218): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second step toward the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translational lemmas, polynomial time, and \((\log n)^j\)-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Enumeration Reducibility / 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 11:13, 13 June 2024

scientific article
Language Label Description Also known as
English
Optimization problems and the polynomial hierarchy
scientific article

    Statements

    Optimization problems and the polynomial hierarchy (English)
    0 references
    0 references
    0 references
    1981
    0 references
    traveling salesman problem
    0 references
    chromatic number problem
    0 references
    maximal clique problem
    0 references
    Knapsack packing problem
    0 references

    Identifiers