One Way Function
Uitgelicht
|
30,73 |
Naar shop
|
|
30,73 |
Naar shop
|
|
136,00 |
Naar shop
|
Beschrijving
Bol
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here "easy" and "hard" are to be understood in the sense of computational complexity theory, specifically the theory of polynomial time problems. The existence of such one-way functions is still an open conjecture. In fact, their existence would prove that the complexity classes P and NP are distinct, thus resolving the foremost unsolved question of theoretical computer science.
Beschrijving
(2)
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here "easy" and "hard" are to be understood in the sense of computational complexity theory, specifically the theory of polynomial time problems. The existence of such one-way functions is still an open conjecture. In fact, their existence would prove that the complexity classes P and NP are distinct, thus resolving the foremost unsolved question of theoretical computer science.
AmazonPagina's: 100, Paperback, Betascript Publishers
ProductspecificatiesPrijzen voor het laatst bijgewerkt op:
Gerelateerde producten
