Complexity results for some eigenvector problems

DOI10.1080/00207160008805009zbMath0967.65050OpenAlexW2054334831MaRDI QIDQ4521209

Georg Gottlob, Thomas Eiter

Publication date: 21 August 2001

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160008805009

zbMATH Keywords

integer programmingcombinatorial optimizationeigenvectorsproblem complexityinteger eigenvalue problems

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Integer programming (90C10) Combinatorial optimization (90C27) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Generalizations of matched CNF formulas

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of optimization problems
• Factoring polynomials with rational coefficients
• On the randomized error of polynomial methods for eigenvector and eigenvalue estimates
• The complexity of selecting maximal solutions
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• Bounded Query Classes

This page was built for publication: Complexity results for some eigenvector problems