Login / Signup
Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption.
Mikhail Anokhin
Published in:
Groups Complex. Cryptol. (2013)
Keyphrases
</>
special case
artificial intelligence
closely related
np complete
efficient computation
real time
website
reinforcement learning
computationally hard