The complexity of promise problems with applications to public-key cryptography (Q3722415): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29543805, #quickstatements; #temporary_batch_1706300061798 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:52, 5 February 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
