On the complexity of matrix rank and rigidity (Q2268340): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4938621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic complexity, Kleene closure, and formal power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of matrix rank and feasible systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compendium of problems complete for symmetric logarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships among $PL$, $\#L$, and the determinant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and importance of logspace-MOD class / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of some problems of linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems complete for deterministic logarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic \(NC^1\) computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on diagonally dominant matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling-based dimension reduction for subspace approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum rank matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking robust nonsingularity is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of linear interval equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393484 / rank
 
Normal rank

Latest revision as of 12:07, 2 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of matrix rank and rigidity
scientific article

    Statements

    On the complexity of matrix rank and rigidity (English)
    0 references
    0 references
    0 references
    5 March 2010
    0 references
    complexity classes
    0 references
    matrix rank
    0 references
    determinant
    0 references
    matrix rigidity
    0 references

    Identifiers