The complexity of promise problems with applications to public-key cryptography (Q3722415)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of promise problems with applications to public-key cryptography |
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
