On approximating the eigenvalues of stochastic matrices in probabilistic logspace (Q2410679): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q62398443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for space-bounded computation / 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: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Matrix Inversion Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Independence Fools Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the de-randomization of space-bounded approximate counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform approximation of \(\text{sgn} (x)\) by polynomials and entire functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded quantum complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of polynomial identity testing and polynomial factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{RL}\subseteq \text{SC}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom walks on regular digraphs and the RL vs. L problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Approximation of Piecewise Analytic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverting well conditioned matrices in quantum logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5727762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank

Latest revision as of 13:39, 14 July 2024

scientific article
Language Label Description Also known as
English
On approximating the eigenvalues of stochastic matrices in probabilistic logspace
scientific article

    Statements

    On approximating the eigenvalues of stochastic matrices in probabilistic logspace (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2017
    0 references
    bounded space computation
    0 references
    randomized algorithms
    0 references
    complete problems
    0 references
    random walks
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references