Aditya Yadav

1 Follower

6 SlideShares 1 Follower 11 Folgens

6 SlideShares 1 Follower 11 Folgens

np-complete polynomial time algorithms quantum quantum computing algorithm shors cryptography rsa artificial intelligence machine learninga logarithmic time mathematics computer science tsp travelling salesman problem np hard graph coloring adiabatic computer

Aktivität
Info

Universal Adiabatic Quantum Computer v1.0

Vor 5 Jahren • 262 Aufrufe

Special Purpose Quantum Annealing Quantum Computer v1.0

Vor 5 Jahren • 948 Aufrufe

Automatski - How We Reinvented Machine Learning, Solved NP-Complete ML Problems & Cracked RSA 2048 Too!!!

Vor 5 Jahren • 173 Aufrufe

Automatski - NP-Complete - TSP - Travelling Salesman Problem Solved in O(N^4)

Vor 5 Jahren • 303 Aufrufe

Automatski - Solution to NP-Complete Graph Coloring

Vor 5 Jahren • 126 Aufrufe

Automatski - RSA-2048 Cryptography Cracked using Shor's Algorithm on a Quantum Computer

Vor 5 Jahren • 1494 Aufrufe

np-complete polynomial time algorithms quantum quantum computing algorithm shors cryptography rsa artificial intelligence machine learninga logarithmic time mathematics computer science tsp travelling salesman problem np hard graph coloring adiabatic computer