Power indices and easier hard problems (Q5751941): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3812222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short propositional formulas represent nondeterministic computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time transformations between combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Algebra and Optimization on Rings are “Hard” / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Very Simple Boolean Formulas with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the planar separator theorem to counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming is Optimal for Nonserial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability Is Quasilinear Complete in NQL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power indices and easier hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank

Latest revision as of 14:28, 21 June 2024

scientific article; zbMATH DE number 4187102
Language Label Description Also known as
English
Power indices and easier hard problems
scientific article; zbMATH DE number 4187102

    Statements

    Power indices and easier hard problems (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    planarity
    0 references
    SAT
    0 references
    NP-complete problems
    0 references
    power index
    0 references
    CLIQUE
    0 references
    separator
    0 references