Ask your own question, for FREE!
Mathematics 15 Online
OpenStudy (nincompoop):

what is the fastest algorithm to multiply two nxn matrices? does P=NP; where P is polynomial time, and NP is nondeterministic polynomial time.

OpenStudy (experimentx):

you trying to do this http://en.wikipedia.org/wiki/P_versus_NP_problem

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!