Some Polynomial and Integer Divisibility Problems are $NP$-Hard (Q4167579): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: David Alan Plaisted / rank | |||
| Property / author | |||
| Property / author: David Alan Plaisted / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0207036 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029244876 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:43, 19 March 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
