<p>Based on <a href="https://cstheory.stackexchange.com/questions/19832/what-are-some-efficient-algorithms-for-determining-if-a-quadratic-multivariate-p">this question</a>, there's an efficient algorithm to determine whether a quadratic multivariate polynomial has a root.</p>

<p>What are some algorithms to enumerate these solutions?  I'm interested in rational roots (working in $\mathbb{Q}$), if possible, or roots over the real numbers or some subfield of the real numbers if not.  I'd like algorithms that are as efficient as possible.</p>

<p>In the case of a large set of solutions (e.g. exponentially or infinitely large), an algorithm whose running time is polynomial in the number of roots would be ideal.</p>

CC BY-SA 3.0
2013-12-09T03:03:08.257Z
Please specify more about your problem.  What field are you working over?   Are you looking at enumerating the solutions to a single quadratic polynomial, or a system of such equations?  What can you tell us about the typical range of parameters you are interested in? The critical parameters include $n$ (the number of variables) and $\mathbb{F}$ (the field you are working in).  Also, you should be aware that the number of solutions can be huge, so it might not be possible to explicitly list them all in polynomial time.  So, do you care about the algorithm's running time?
D.W.
CC BY-SA 3.0
2013-12-09T03:15:06.307Z
Thanks for the comment, @D.W. The most important thing is the running time. So while I'd be interested in a system of equations, just one like in the linked question is fine. `n` can be any number > 2 and the order of the polynomial is always quadratic. All solutions should be over the rationals. Or the reals (or some subfield of the reals) if that's not feasible.
Joe
CC BY-SA 3.0
2013-12-09T04:00:20.453Z
Thanks, @Joe.  Some etiquette for this site: when responding to requests for clarifications, we like you to edit your original question to add those clarifications to the question, so people don't need to read the comments to understand the problem.  I've done that for you this time.  Separately: I noticed you didn't respond to my comment that the set of solutions could be large (e.g., infinitely large; or exponentially large).  What were you thinking ought to be done about that?  Are you looking for an algorithm whose running time is polynomial in the number of roots, or something like that?
D.W.
CC BY-SA 3.0
2013-12-14T21:44:08.037Z
Thanks, @D.W. and for the edits. I'll do that next time. As for the large solutions, "running time is polynomial in the number of roots" is perfect. I'll update the question.
Joe
<cc.complexity-theory><polynomials><polynomial-time><quadratic>
What are some efficient algorithms for finding the solutions to a quadratic multivariate polynomial?
Joe
# What are some efficient algorithms for finding the solutions to a quadratic multivariate polynomial?

(Asked by: username_0 on 2013-12-08)

Based on [this question](https://cstheory.stackexchange.com/questions/19832/what-are-some-efficient-algorithms-for-determining-if-a-quadratic-multivariate-p), there's an efficient algorithm to determine whether a quadratic multivariate polynomial has a root.

What are some algorithms to enumerate these solutions? I'm interested in rational roots (working in $\mathbb{Q}$), if possible, or roots over the real numbers or some subfield of the real numbers if not. I'd like algorithms that are as efficient as possible.

In the case of a large set of solutions (e.g. exponentially or infinitely large), an algorithm whose running time is polynomial in the number of roots would be ideal.

**Tags:** cc.complexity-theory, polynomials, polynomial-time, quadratic
> **Comments:**
> **username_1**: Please specify more about your problem.  What field are you working over?   Are you looking at enumerating the solutions to a single quadratic polynomial, or a system of such equations?  What can you tell us about the typical range of parameters you are interested in? The critical parameters include $n$ (the number of variables) and $\mathbb{F}$ (the field you are working in).  Also, you should be aware that the number of solutions can be huge, so it might not be possible to explicitly list them all in polynomial time.  So, do you care about the algorithm's running time?  
> **username_0**: Thanks for the comment, @D.W. The most important thing is the running time. So while I'd be interested in a system of equations, just one like in the linked question is fine. `n` can be any number > 2 and the order of the polynomial is always quadratic. All solutions should be over the rationals. Or the reals (or some subfield of the reals) if that's not feasible.  
> **username_1**: Thanks, @Joe.  Some etiquette for this site: when responding to requests for clarifications, we like you to edit your original question to add those clarifications to the question, so people don't need to read the comments to understand the problem.  I've done that for you this time.  Separately: I noticed you didn't respond to my comment that the set of solutions could be large (e.g., infinitely large; or exponentially large).  What were you thinking ought to be done about that?  Are you looking for an algorithm whose running time is polynomial in the number of roots, or something like that?  
> **username_0**: Thanks, @D.W. and for the edits. I'll do that next time. As for the large solutions, "running time is polynomial in the number of roots" is perfect. I'll update the question.  

---

## 0 answers

