Kilichbek HaydarovToward An Optimal Matrix Multiplication AlgorithmHow fast can we multiply two n × n matrices? A problem in computer science is to determine the time complexity of Matrix multiplication.Nov 1, 20184Nov 1, 20184
Kilichbek HaydarovRandomness Is A Hard Challenge For ComputersHow can a deterministic computer produce genuinely random numbers? And does it even need to? Yes, computers need to have access to random…Sep 11, 2018Sep 11, 2018
Kilichbek HaydarovThe Greatest Common Divisor in PythonThe Greatest Common Divisor ( GCD ) of two integers is the largest integer that divides both of these integers. However, it is not…Jul 23, 2018Jul 23, 2018