Problems complete for \(\oplus L\)

DOI10.1016/0020-0190(90)90150-VzbMath0706.68049OpenAlexW2058503290MaRDI QIDQ918696

Carsten Damm

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90150-v

zbMATH Keywords

Turing machinescomplexity classesmatrices over finite fieldsmodels of computation

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ Formal languages over GF(2)

Cites Work

• On computing the determinant in small parallel time using a small number of processors
• A taxonomy of problems with fast parallel algorithms
• Fast parallel matrix and GCD computations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Problems complete for \(\oplus L\)