Optimal approximation of sparse hessians and its equivalence to a graph coloring problem (Q4745216): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02592052 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988783936 / rank | |||
Normal rank | |||
Latest revision as of 10:01, 30 July 2024
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
