Kilichbek Haydarov·Nov 1, 2018Toward 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.A response icon4A response icon4
Kilichbek Haydarov·Sep 11, 2018Randomness 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…
Kilichbek Haydarov·Jul 23, 2018The 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…