Hybrid Continued Fractions and n-adic algorithms, with applications to cryptography and "unimaginable' numbers.
Antonino LeonardisPublished in: CoRR (2019)
Keyphrases
- computational complexity
- learning algorithm
- hybrid approaches
- recently developed
- times faster
- computationally expensive
- orders of magnitude
- data mining techniques
- significant improvement
- artificial intelligence
- upper bound
- theoretical analysis
- benchmark datasets
- data structure
- bayesian networks
- memory requirements
- real time