Some Polynomial and Integer Divisibility Problems are $NP$-Hard (Q4167579): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:19, 6 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
