Group: Tyler Hoskins & Will Stout

Title: Linear Algebra and Algorithm Complexity in Computer Science

Abstract: When computing algorithms, there is always a cost allocated to
machines performance. Most of the familiar tradeoffs exchange between space
complexities and timing complexities. This is crucial in computing, when
determining what algorithm to use. Some algorithms may be cost effective
while some may cost more for both time and space. Computing a matrix by
hand may be easier for a certain method but as the size of the matrix
grows, a different method will compute the results quicker.