Cyclotomic identity testing and applications
We consider the cyclotomic identity testing (CIT) problem: given a polynomial f(x1,…,xk), decide whether f(ζne1, …,ζnek) is zero, where ζn = e2π i/n is a primitive complex n-th root of unity and e1,…,ek are integers, represented in binary. When f is given by an algebraic circuit, we give a randomize...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Language: | English |
| Published: |
Association for Computing Machinery
2021
|