Strict sequential P-completeness

DOI10.1007/BFb0023470zbMath1498.68128MaRDI QIDQ5048935

Klaus Reinhardt

Publication date: 9 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Cites Work

• A complexity theory of efficient parallel algorithms
• A theory of strict P-completeness
• A taxonomy of problems with fast parallel algorithms
• New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
• A theory of strict P-completeness
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strict sequential P-completeness