Some Polynomial and Integer Divisibility Problems are $NP$-Hard (Q4167579): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1238600 |
||
| Property / author | |||
| Property / author: David Alan Plaisted / rank | |||
Revision as of 21:15, 22 February 2024
scientific article; zbMATH DE number 3601107
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some Polynomial and Integer Divisibility Problems are $NP$-Hard |
scientific article; zbMATH DE number 3601107 |
Statements
Some Polynomial and Integer Divisibility Problems are $NP$-Hard (English)
0 references
1978
0 references
