963 search results - page 23 / 193 » On the decomposition of rational functions |
DAM
2007
13 years 8 months ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
ICCAD
1997
IEEE
14 years 26 days ago
1997
IEEE
In this paper we present an algorithm for converting a BDD representation of a logic function into a multiple-level netlist of disjoint-support subfunctions. On the theoretical si...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
EUROCRYPT
2004
Springer
14 years 2 months ago
2004
Springer
ASPDAC
2000
ACM
14 years 1 months ago
2000
ACM