61 search results - page 1 / 13 » Using Elimination Theory to construct Rigid Matrices |
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
The rigidity of a matrix A for target rank r is the minimum number of entries of A that
LFCS
2009
Springer
13 years 11 months ago
2009
Springer
Canonical propositional Gentzen-type calculi are a natural class of systems which in addition to the standard axioms and structural rules have only logical rules where exactly one ...
SIAMMAX
2010
12 years 11 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
ISSAC
1997
Springer
13 years 9 months ago
1997
Springer
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...
CSR
2008
Springer
13 years 5 months ago
2008
Springer
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...