Complexity results for some eigenvector problems (Q4521209): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of selecting maximal solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the randomized error of polynomial methods for eigenvector and eigenvalue estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms for Finding Integer Relations among Real Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank

Latest revision as of 11:19, 3 June 2024

scientific article; zbMATH DE number 1545210
Language Label Description Also known as
English
Complexity results for some eigenvector problems
scientific article; zbMATH DE number 1545210

    Statements

    Complexity results for some eigenvector problems (English)
    0 references
    0 references
    0 references
    21 August 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    integer programming
    0 references
    eigenvectors
    0 references
    problem complexity
    0 references
    combinatorial optimization
    0 references
    integer eigenvalue problems
    0 references
    0 references