Results 231 to 240 of about 16,145 (263)
Some of the next articles are maybe not open access.
2010
This is a self-contained 2010 account of the state of the art in classical complex multiplication that includes recent results on rings of integers and applications to cryptography using elliptic curves. The author is exhaustive in his treatment, giving a thorough development of the theory of elliptic functions, modular functions and quadratic number ...
openaire +1 more source
This is a self-contained 2010 account of the state of the art in classical complex multiplication that includes recent results on rings of integers and applications to cryptography using elliptic curves. The author is exhaustive in his treatment, giving a thorough development of the theory of elliptic functions, modular functions and quadratic number ...
openaire +1 more source
Complex aggregation at multiple granularities
1998Datacube queries compute simple aggregates at multiple granularities. In this paper we examine the more general and useful problem of computing a complex subquery involving multiple dependent aggregates at multiple granularities. We call such queries “multi-feature cubes.” An example is “Broken down by all combinations of month and customer, find the ...
Kenneth A. Ross +2 more
openaire +1 more source
Parallel complexity of matrix multiplication
J. Supercomput., 2003Matrix multiplication is a kernel of many numerical algorithms, thus finding efficient and parallel solution to this problem is one of the most important topics in scientific computing. In this paper, the parallel complexity of multiplying two matrices (using the standard row/column method) on parallel distributed-memory computers is studied.
openaire +1 more source
Efficient complex matrix multiplication
IEEE Transactions on Computers, 1988Multiplication of the complex numbers x and y, where \(x=a+ib\) and \(y=c+id\), requires four real multiplications, while the identity \(xy=(a(c-d)+(a-b)d)+i(b(c+d)+(a-b)d)\) requires three real multiplications instead. The author observes that this identity could be used for multiplication of complex matrices.
openaire +1 more source
The multiplicative complexity of boolean functions
1989Let the multiplicative complexity L(f) of a boolean function f be the minimal number of Λ-gates (with two entries) that are sufficient to evaluate f by circuits over the basis Λ,⊕,1. We relate L(f) with the dimension of the dual domain D(f); D(f) is the minimal linear space of linear boolean forms such that f modulo linear functions can be written as a
openaire +2 more sources
On the complexity of quaternion multiplication
Information Processing Letters, 1975openaire +2 more sources
Multiplicative Complexity of XOR Based Regular Functions
IEEE Transactions on Computers, 2022Valentina Ciriani +2 more
exaly
Multiplicative complexity of bijective 4×4 S-boxes
Cryptography and Communications, 2014Pavol Zajac
exaly