Please enable JavaScript.
Coggle requires JavaScript to display documents.
m15 - Coggle Diagram
m15
Matrix multiplication
n³ time
Fast fourier method
read book
polynomial algorithm
Random Numbers
What is being random?
unpredictable
pseudorandom
Also we discuss the limitations of programming
get a problem, divide it, and maximize productiveness
REDUCTION
Examples: simettric matrices ( optimization )
NP completeness
theory
hard problems to code, basically
problematic, like exponential or factorial
a lot of NP problems are not able to even run at normal computers even at lower inputs
