Q5002644 (Q5002644): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.41 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Normalized graph Laplacians for directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized inverses. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the determinant in small parallel time using a small number of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing games on directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel matrix and GCD computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5213151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacians and the Cheeger inequality for directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Matrix Inversion Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the eigenvalues of stochastic matrices in probabilistic logspace / 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: Upper bounds on Poisson tail probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues of graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple, combinatorial algorithm for solving SDD systems in nearly-linear time / 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: Symmetric space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{RL}\subseteq \text{SC}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parallel solver for SDD linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The condition numbers of the matrix eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Sparsification of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems / 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: An $O(\logn \log\logn)$ Space Algorithm for Undirected st-Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lx = b / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded quantum complexity / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.APPROX-RANDOM.2017.41 / rank
 
Normal rank

Latest revision as of 15:35, 30 December 2024

scientific article; zbMATH DE number 7375846
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7375846

    Statements

    0 references
    0 references
    0 references
    28 July 2021
    0 references
    Laplacian solvers
    0 references
    randomized logspace
    0 references
    bounded-space complexity classes
    0 references
    random walks
    0 references
    matrix computation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers