1469 search results - page 9 / 294 » Approximate polynomial decomposition |
RML
2000
14 years 9 months ago
2000
54
Voted
ICMS
2010
14 years 8 months ago
2010
DSD
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper focuses on numerical function generators (NFGs) based on k-th order polynomial approximations. We show that increasing the polynomial order k reduces significantly the...
INFORMATICALT
2010
14 years 8 months ago
2010
The asymmetric cipher protocol, based on decomposition problem in matrix semiring M over semiring of natural numbers N is presented. The security of presented cipher protocol is ba...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...