Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Alain P. Hiltgen"'
Autor:
Mike Paterson, Alain P. Hiltgen
Publikováno v:
Computational Complexity. 5:132-154
Let D: {0,1}n $ {0, 1}m be an m-output Boolean function in n variables. The k-slice of D is the monotone function Dsl-k defined component-wise by D (i)sl-k = (D (i) [ Tn k ) Z Tn k +1 , where Tnk is the kth threshold function. Wegener showed that cer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41e03c618c6acc5b90be29318f9697e6
https://doi.org/10.1007/bf01268142
https://doi.org/10.1007/bf01268142
Autor:
Alain P. Hiltgen, George S. Moschytz
Publikováno v:
International Journal of Circuit Theory and Applications. 18:145-163
In attempting to use the pole-zero assignment for gain sensitivity minimization in biquadratic filter cascades, a new expression for the total gain error is derived. In this result the logarithmic gain slope appears as a weighting factor to a second
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ac78073930b7bf51fcc8f5723c54ea8
https://doi.org/10.1002/cta.4490180205
https://doi.org/10.1002/cta.4490180205
Autor:
Alain P. Hiltgen
Publikováno v:
Advances in Cryptology — AUSCRYPT '92 ISBN: 9783540572206
AUSCRYPT
AUSCRYPT
The unrestricted circuit complexity C(.) over the basis of all logic 2-input/1-output gates is considered. It is proved that certain explicitly defined families of permutations {fn} are feebly-one-way of order 2, i.e., the functions fn satisfy the pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::323c209e268b3a5e3ec57deb12b76a64
https://doi.org/10.1007/3-540-57220-1_80
https://doi.org/10.1007/3-540-57220-1_80
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.