Difficult: I think I understood the material pretty well. The hardest part was during the proof of the correctness of the Solovay-Strassen primality test. It really wasn't that bad, but did have a lot of parts.
Reflective: It is interesting how reliable these probabilistic tests are. It is trivial to test a large number of paces, and come with a very tight bound on the error. It is also interesting that even deterministic algorithms have error, due to problems with hardware, and so at some point might really not be that much more reliable.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment