|
|||
CMSI 475 Computational Complexity3 semester hours Introduction to the study of computational complexity, including efficient algorithms for matrix multiplication and fast Fourier transforms, the classes P and NP, approximation algorithms, randomized algorithms and RP, parallel algorithms and NC. Lecture, 3 hours. Prerequisites: CMSI 282 and CMSI 385 . |
|||
All bulletins © 2024 Loyola Marymount University. Powered by the Acalog™ Academic Catalog Management System™ (ACMS™).
|