Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with polynomials
Search options not deleted
user 116231
Questions in which polynomials (single or several variables) play a key role. It is typically important that this tag is combined with other tags; polynomials appear in very different contexts. Please, use at least one of the top-level tags, such as nt.number-theory, co.combinatorics, ac.commutative-algebra, in addition to it. Also, note the more specific tags for some special types of polynomials, e.g., orthogonal-polynomials, symmetric-polynomials.
8
votes
0
answers
356
views
Computing coefficients of polynomials from roots in $O(n\log{n})$ time
Suppose I have a univariate polynomial $p$ over a prime-order finite field $\mathbb{F}_q$ whose roots I know.
Suppose that the roots of $p$ are always an $n$-sized subset of $R=\{1,2,\dots,N\}, N < q …
- 191
6
votes
0
answers
429
views
Computing remainders modulo $\prod_{i\in S} (x-x_i)$ fast using FFT
Note: Originally asked on Math StackExchange here, without an answer. Figured I should try here, since this is a more research-level question.
I am trying to implement a fast polynomial multipoint ev …
- 191