Computational complexity of mathematical operations
Semantic Scholar uses AI to extract papers important to this topic.
- IEEE Transactions on Information Theory
The Ihara limit (or constant) A(q) has been a central problem of study in the asymptotic theory of global function fields (or… (More)
We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of… (More)
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning… (More)
- 2004 IEEE Region 10 Conference TENCON 2004.
Low-power and high-speed implementation of discrete cosine transform (DCT) for mobile multimedia terminals presents a hardware… (More)
From the existence of a tower of algebraic function fields, we improve upper bounds on the bilinear complexity of multiplication… (More)
1. PREFACE This is a revised and updated version of . Paris Kanellakis and the second author (Smolka) were among the first to… (More)
We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear… (More)
In combinatorial auctions, multiple goods are sold simultaneously and bidders may bid for arbitrary combinations of goods… (More)
Fast algorithms for computing the product by a vector are presented for a number of classes of matrices whose properties relate… (More)