A compendium of problems complete for symmetric logarithmic space

DOI10.1007/PL00001603zbMath0970.68070WikidataQ56474976 ScholiaQ56474976MaRDI QIDQ5930152

Raymond Greenlaw, Carme Àlvarez

Publication date: 17 April 2001

Published in: Computational Complexity (Search for Journal in Brave)

zbMATH Keywords

symmetric logarithmic space

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (9)

Equivalence classes and conditional hardness in massively parallel computations ⋮ On approximating the eigenvalues of stochastic matrices in probabilistic logspace ⋮ Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space ⋮ Unnamed Item ⋮ A faster algorithm for determining the linear feasibility of systems of BTVPI constraints ⋮ Cyclic Extensions of Order Varieties ⋮ On the complexity of matrix rank and rigidity ⋮ Unnamed Item ⋮ The complexity of satisfiability problems: Refining Schaefer's theorem

This page was built for publication: A compendium of problems complete for symmetric logarithmic space