Optimal approximation of sparse hessians and its equivalence to a graph coloring problem (Q4745216)

From MaRDI portal
Revision as of 10:01, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3800878
Language Label Description Also known as
English
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
scientific article; zbMATH DE number 3800878

    Statements

    Optimal approximation of sparse hessians and its equivalence to a graph coloring problem (English)
    0 references
    1983
    0 references
    sparse Hessian approximation
    0 references
    graph coloring heuristics
    0 references
    elimination methods
    0 references
    NP-complete
    0 references
    direct methods
    0 references

    Identifiers

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