The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear |
| |
Authors: | S N Selezneva |
| |
Institution: | 1. Department of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119991, Russia
|
| |
Abstract: | It is proved that for each fixed composite number k, the circuit complexity of the problem which is to check if an arbitrary function f(x 1, ..., x n ) over a residue ring modulo k given by its value vector with length N = k n and, if so, to construct its polynomial representation is linear. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|