The complexity of promise problems with applications to public-key cryptography (Q3722415): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 14:28, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of promise problems with applications to public-key cryptography |
scientific article |
Statements
The complexity of promise problems with applications to public-key cryptography (English)
0 references
1984
0 references
partial decision problem
0 references
Turing reducibility
0 references
NP-hard cracking problems
0 references
NP-complete sets
0 references
Turing machines
0 references
