Results 281 to 290 of about 17,450 (322)
Some of the next articles are maybe not open access.
On the asymptotic complexity of matrix multiplication
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981), 1981The main results of this paper have the following flavor: Given one algorithm for multiplying matrices, there exists another, better, algorithm.
Don Coppersmith, Shmuel Winograd
openaire +2 more sources
Toward Finding S-Box Circuits With Optimal Multiplicative Complexity
IEEE transactions on computersIn this paper, we present a new method to find S-box circuits with optimal multiplicative complexity (MC), i.e., MC-optimal S-box circuits. We provide new observations for efficiently constructing circuits and computing MC, combined with a popular ...
Yongjin Jeon +2 more
semanticscholar +1 more source
On the multiplicative complexity of discrete cosine transforms
IEEE Transactions on Information Theory, 1992S Winograd
exaly +2 more sources
2005
In this chapter we present a method for finding a curve and the group order of its Jacobian which can be seen as complementary to those in Sections 17.2 and 17.3. Instead of trying several random curves over a fixed finite field until a good one is found and determining the group order by computing the characteristic polynomial of the Frobenius ...
Frey, G., Lange, T.
openaire +1 more source
In this chapter we present a method for finding a curve and the group order of its Jacobian which can be seen as complementary to those in Sections 17.2 and 17.3. Instead of trying several random curves over a fixed finite field until a good one is found and determining the group order by computing the characteristic polynomial of the Frobenius ...
Frey, G., Lange, T.
openaire +1 more source
Jacobians with complex multiplication
1991In this paper we will say that a simple abelian variety X is of CM type if there is a number field K with [K: Q] = 2 dim(X) such that K ⊂ End°(X). If X is any abelian variety, then we will say that X is of CM type if all its simple factors are. Equivalently, X is of CM type if there are number fields K i such that Σ[K i: Q] = 2dim(X) and ⊕K i ⊂ End°(X).
Jong, A.J. de, Noot, R.
openaire +2 more sources
Complexity and Multiple Complexes
2003In this chapter we introduce the notion of the complexity of a module and explore some related ideas. Complexity was first defined by Jon Alperin in the late 1970’s and it helped to motivate much of the development of the homological properties of modules.
Jon F. Carlson +3 more
openaire +1 more source
Proceedings of the 2005 European Conference on Circuit Theory and Design, 2005., 2006
Multiple constant multiplication (MCM) has been an active research area for the last decade. Most work so far have only considered the number of additions to realize a number of constant multiplications with the same input. In this work, we consider the number of full and half adder cells required to realize those additions, and a novel complexity ...
Kenny Johansson +2 more
openaire +1 more source
Multiple constant multiplication (MCM) has been an active research area for the last decade. Most work so far have only considered the number of additions to realize a number of constant multiplications with the same input. In this work, we consider the number of full and half adder cells required to realize those additions, and a novel complexity ...
Kenny Johansson +2 more
openaire +1 more source
On the Multiplication of Complex Numbers
The Mathematical Gazette, 1949In the development of the theory of complex numbers, it is important to give a definition of them dependent only upon real numbers. In the usual algebraic treatments the product is postulated in the form or obtained from a matrix representation.
openaire +2 more sources
On the Additive Complexity of Matrix Multiplication
SIAM Journal on Computing, 1976A graph-theoretic model is introduced for bilinear algorithms. This facilitates in particular the investigation of the additive complexity of matrix multiplication. The number of additions/subtractions required for each of the problems defined by symmetric permutations on the dimensions of the matrices are shown to differ conversely as the size of each
openaire +2 more sources