Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > MULTIVARIATE POLYNOMIAL FACTORING:
Reports tagged with Multivariate Polynomial Factoring:
TR05-008 | 11th December 2004
Neeraj Kayal

#### Recognizing permutation functions in polynomial time.

Let $\mathbb{F}_q$ be a finite field and $f(x) \in \mathbb{F}_q(x)$ be a rational function over $\mathbb{F}_q$.
The decision problem {\bf PermFunction} consists of deciding whether $f(x)$ induces a permutation on
the elements of $\mathbb{F}_q$. That is, we want to decide whether the corresponding map
$f : \mathbb{F}_q ... more >>> TR20-077 | 19th May 2020 Amit Sinhababu, Thomas Thierauf #### Factorization of Polynomials Given by Arithmetic Branching Programs Given a multivariate polynomial computed by an arithmetic branching program (ABP) of size$s$, we show that all its factors can be computed by arithmetic branching programs of size$\text{poly}(s)\$. Kaltofen gave a similar result for polynomials computed by arithmetic circuits. The previously known best upper bound for ABP-factors was ... more >>>

ISSN 1433-8092 | Imprint