PGSWPolish Genealogical Society of Wisconsin
References in periodicals archive ?
For the dimension parameter N and the depth parameter L , GSW scheme evaluates depth- Lcircuits of NAND gates with O([N.sup.4+[omega]] * [[kappa].sup.4]) field operations for per gate, where [omega] < 2.3727; In PGSW scheme, the field operations of per gate is O(N), so the time complexity for evaluating depth- L circuits of NAND gates is O(NL) while GSW scheme is O([N.sup.4+[omega]] * [[kappa].sup.4]*L).
It can be seen that the time complexity of PGSW has been greatly improved.
In this paper, we optimize GSW scheme by the parallel computing, and then gain PGSW scheme.