Vandermonde matrices, NP-completeness, and transversal subspaces

被引:10
作者
Chistov, A [1 ]
Fournier, H
Gurvits, L
Koiran, P
机构
[1] Russian Acad Sci, St Petersburg Inst Informat & Automat, St Petersburg, Russia
[2] Univ Versailles, F-78035 Versailles, France
[3] Los Alamos Natl Lab, Los Alamos, NM 87545 USA
[4] Ecole Normale Super Lyon, LIP, F-69364 Lyon 07, France
关键词
D O I
10.1007/s10208-002-0076-4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Let K be an infinite field. We give polynomial time constructions of families of r-dimensional subspaces of K-n with the following transversality property: any linear subspace of K-n of dimension n - r is transversal to at least one element of the family. We also give a new NP-completeness proof for the following problem: given two integers n and m with n less than or equal to m and a n x m matrix A with entries in Z, decide whether there exists an n x n subdeterminant of A which is equal to zero.
引用
收藏
页码:421 / 427
页数:7
相关论文
共 15 条
[1]   THE COMPLEXITY AND APPROXIMABILITY OF FINDING MAXIMUM FEASIBLE SUBSYSTEMS OF LINEAR RELATIONS [J].
AMALDI, E ;
KANN, V .
THEORETICAL COMPUTER SCIENCE, 1995, 147 (1-2) :181-210
[2]  
CAI J, 1996, LECT NOTES COMPUTER, V1046, P307
[3]  
Chandrasekaran R., 1982, Operations Research Letters, V1, P101, DOI 10.1016/0167-6377(82)90006-2
[4]  
CHISTOV A, 1985, LECT NOTES COMPUTER, V199, P9
[5]  
CHISTOV A, 1984, P 7 SOV C MATH LOG N
[6]   FAST ALGORITHMS FOR N-DIMENSIONAL RESTRICTIONS OF HARD PROBLEMS [J].
DERHEIDE, FMA .
JOURNAL OF THE ACM, 1988, 35 (03) :740-747
[7]   On the complexity of computing mixed volumes [J].
Dyer, M ;
Gritzmann, P ;
Hufnagel, A .
SIAM JOURNAL ON COMPUTING, 1998, 27 (02) :356-400
[8]   New lower bounds for convex hull problems in odd dimensions [J].
Erickson, J .
SIAM JOURNAL ON COMPUTING, 1999, 28 (04) :1198-1214
[9]   ON THE COMPLEXITY OF APPROXIMATING EXTREMAL DETERMINANTS IN MATRICES [J].
KHACHIYAN, L .
JOURNAL OF COMPLEXITY, 1995, 11 (01) :138-153
[10]  
LOIRAN P, 2001, 0134 LIP