Sciweavers

Share
15 search results - page 1 / 3
» Average-case complexity of the min-sum matrix product proble...
Sort
View
JC
2011
102views more  JC 2011»
10 years 1 months ago
Tractability of tensor product problems in the average case setting
It has been an open problem to derive a necessary and suļ¬ƒcient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
Anargyros Papageorgiou, Iasonas Petras
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
8 years 8 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
François Le Gall
DISOPT
2011
201views Education» more  DISOPT 2011»
9 years 9 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
11 years 3 days ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
SIAMNUM
2011
139views more  SIAMNUM 2011»
10 years 1 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson
books