Decomposition of arithmetical np-hard problems (Q4323719): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Probability functions on complex pedigrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank | |||
Normal rank | |||
Latest revision as of 11:04, 23 May 2024
scientific article; zbMATH DE number 724758
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposition of arithmetical np-hard problems |
scientific article; zbMATH DE number 724758 |
Statements
Decomposition of arithmetical np-hard problems (English)
0 references
20 February 1995
0 references
NP-hard problem
0 references
hypergraph
0 references
causal networks
0 references
