d Abstract) Tomoyuki Yamakami Department of Computer Software, University of Aizu 90 Kami-Iawase, Tsuruga, Ikki-machi, Fukushima 965-8580, Japan Our task of quantum list decoding ...
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
The paper investigates the properties of certain biorthogonal polynomials appearing in a specific simultaneous Hermite–Pad´e approximation scheme. Associated with any totally ...
As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of deterministic Boolean computation is increasingly challeng...