Strict sequential P-completeness

DOI10.1007/BFB0023470zbMATH Open1498.68128MaRDI QIDQ5048935FDOQ5048935

Authors: Klaus Reinhardt 

Publication date: 9 November 2022

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

Recommendations

• A theory of strict P-completeness
• A theory of strict P-completeness
• scientific article; zbMATH DE number 784042
• scientific article; zbMATH DE number 4062587
• On the Average Case Complexity of Some P-complete Problems

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

• Title not available (Why is that?)
• A taxonomy of problems with fast parallel algorithms
• Title not available (Why is that?)
• A complexity theory of efficient parallel algorithms
• New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
• A theory of strict P-completeness
• A theory of strict P-completeness
• Title not available (Why is that?)

Cited In (2)

• A theory of strict P-completeness
• A theory of strict P-completeness

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048935)