Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (Q915446): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3747725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems over power sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On gamma-reducibility versus polynomial time many-one reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Presburger arithmetic with fixed quantifier dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of checking and evaluating / rank
 
Normal rank

Latest revision as of 08:31, 21 June 2024

scientific article
Language Label Description Also known as
English
Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems
scientific article

    Statements

    Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (English)
    0 references
    1990
    0 references
    optimization problem
    0 references
    many-one reducibility
    0 references
    NP-complete problem
    0 references
    Turing reducibility
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references