Back to Results
First PageMeta Content
Computational complexity theory / Theory of computation / Complexity classes / Analysis of algorithms / Finite fields / NP / Spacetime tradeoff / Algorithm / Time complexity / IP / P / XTR


Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem Alex Biryukov Dmitry Khovratovich
Add to Reading List

Document Date: 2016-02-22 10:06:03

Open Document

File Size: 439,51 KB

Share Result on Facebook