Some Polynomial and Integer Divisibility Problems are $NP$-Hard (Q4167579)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3601107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
