We may earn an affiliate commission when you visit our partners.

Algebra for Computer Science

Lars Garding and Torbjörn Tambour
Lars Garding, Torbjörn Tambour. Using the language of linear algebra , we can say that a is algebraic of degree at ... all powers of a are linear rational combinations of the powers with exponent < n . We can rephrase this last result as ...
result as ...

Save this book

Save Algebra for Computer Science to your list so you can find it easily later:
Save

Share

Help others find this book page by sharing it with your friends and followers:
Our mission

OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.

Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.

Find this site helpful? Tell a friend about us.

Affiliate disclosure

We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.

Your purchases help us maintain our catalog and keep our servers humming without ads.

Thank you for supporting OpenCourser.

© 2016 - 2024 OpenCourser