This research project is aimed at studying the theory of NP-Completeness and determining the complexity of certain problems in linear algebra. The first chapter introduces the reader to Complexity theory and defines NP-Completeness. It is supported by Appendices 1 and 2. Appendix 3 lists some known NP-Complete problems.
Sastry '90, Santhosh, "Some NP-Complete Problems in Linear Algebra" (1990). Honors Projects. Paper 13.