39 search results - page 3 / 8 » Monotone complexity and the rank of matrices |
IPPS
1994
IEEE
13 years 10 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
ISAAC
2007
Springer
14 years 22 days ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
DAGSTUHL
2006
13 years 8 months ago
2006
Structured linear algebra techniques enable one to deal at once with various types of matrices, with features such as Toeplitz-, Hankel-, Vandermonde- or Cauchy-likeness. Following...