Sciweavers

39 search results - page 1 / 8
» Monotone complexity and the rank of matrices
Sort
View
ECCC
2002
103views more  ECCC 2002»
13 years 5 months ago
Monotone complexity and the rank of matrices
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
Pavel Pudlák
CSR
2007
Springer
13 years 11 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma
COLT
2005
Springer
13 years 11 months ago
Rank, Trace-Norm and Max-Norm
We study the rank, trace-norm and max-norm as complexity measures of matrices, focusing on the problem of fitting a matrix with matrices having low complexity. We present generali...
Nathan Srebro, Adi Shraibman
FCS
2006
13 years 6 months ago
New Approach To A Class Of Matrices
The displacement structure is extended to a Kronecker matrix W Z. A new class of Kronecker-like matrices with the displacement rank r, r < n will be formulated and presented. ...
Z. Chen
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
13 years 9 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan