Vandermonde matrices, NP-completeness, and transversal subspaces

Foundations of Computational Mathematics

Volumn 3, Issue 4, 2003, Pages 421-427

  Chistov, Alexander ^a   Fournier, Hervé ^b   Gurvits, Leonid ^c   Koiran, Pascal ^d  

^a ST PETERSBURG INSTITUTE FOR INFORMATICS AND AUTOMATION   (Russian Federation)

^b UNIVERSITY OF VERSAILLES   (France)

^c LOS ALAMOS NATIONAL LABORATORY   (United States)

^d UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

TRANSVERSAL SUBSPACES; VANDERMONDE MATRICES;

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; PARALLEL ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

MATRIX ALGEBRA;

EID: 0345134679     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208-002-0076-4     Document Type: Article

References (15)

1. E. Amaldi and V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations, Theoret. Comput. Sci. 147 (1995), 181-210.
2. J. Cai, A. Naik, and D. Sivakumar, On the existence of hard sparse sets under weak reductions, in Proc. STACS'96, Lectures Notes in Computer Science, Vol. 1046, Springer-Verlag, New York, 1996, pp. 307-318.
3. R. Chandrasekaran, S. N. Kabadi, and K. Murty, Some NP-complete problems in linear programming, Oper. Res. Lett. 1 (1982), 101-103.
4. A. Chistov, Constructing a finite field within a polynomial time, in Proc. 7th Soviet Conference on Mathematical Logic, Novosibirsk, 1984 (in Russian).
5. A. Chistov, Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic, in Proc. 5th International FCT Conference, Lectures Notes in Computer Science, Vol. 199, Springer-Verlag, New York, 1985, pp. 9-13.
6. M. Dyer, P. Gritzmann, and A. Hufnagel, On the complexity of computing mixed volumes, SIAM J. Comput. 27(2) (1998), 356-400.
7. J. Erickson, New lower bounds for convex hull problems in odd dimensions, SIAM J. Comput. 28(4) (1999), 1198-1214.
8. L. Khachiyan, On the complexity of approximating extremal determinants in matrices, J. Complexity 11 (1995), 138-153.
9. P. Koiran, N. Portier, and G. Villard, A rank theorem for Vandermonde matrices. LIP Research Report 01-34, 2001.
10. S. Meiser, Point location in arrangements of hyperplanes, Inform. and Comput. 106(2) (1993), 286-303.
11. F. Meyer auf der Heide, A polynomial linear search algorithm for the n-dimensional knapsack problem, J. Assoc. Comput. Mach. 31(3) (1984), 668-676.
12. F. Meyer auf der Heide Fast algorithms for n-dimensional restrictions of hard problems, J. Assoc. Comput. Mach. 35(3) (1988), 740-747.
13. K. Mulmuley, A fast parallel algorithm to compute the rank of a matrix over an arbitrary field, in Proc. 18th ACM Symposium on Theory of Computing, 1986, pp. 338-339.
14. M.-F. Roy and N. Vorobjov, The complexification and degree of a semi-algebraic set, Math. Z. 239(1) (2002), 131-142.
15. V. Shoup, New algorithms for finding irreducible polynomials over finite fields, Math. Comp. 54 (1990), 435-447.