Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have a $t \times l$-polynomial matrix $A$ over $\mathbb{F}_q[x]$. The entries of $A$ are of degree $\le m$. I want to reduce $A$ to upper-triangular form by Gaussian elimination in case of using the Euclidean division instead of the exact one. What the worst-case computational (time) complexity it will take?

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.