On the Average Case Complexity of Some P-complete Problems

DOI10.1051/ITA:1999104MaRDI QIDQ4256141zbMATH OpenOpenAlexFDO

Authors Maria Serna, Fatos Xhafa

Publication date 13 December 1999

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/221996

zbMATH Keywords

P-complete problems

Mathematics Subject Classification ID

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

Cites work

• An observation on time-storage trade off
• Approximating linear programming is log-space complete for P
• Complete problems for deterministic polynomial time
• scientific article; zbMATH DE number 4155879 (Why is no real title available?)
• scientific article; zbMATH DE number 1372652 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• P-Complete Approximation Problems
• Probabilistic analysis of a parallel algorithm for finding maximal independent sets

Cited in

(10)

• The enumerability of P collapses P to NC
• scientific article; zbMATH DE number 4155879 (Why is no real title available?)
• scientific article; zbMATH DE number 4062587 (Why is no real title available?)
• On Average Case Complexity of SAT for Symmetric Distribution
• Matrix Transformation Is Complete for the Average Case
• scientific article; zbMATH DE number 1180007 (Why is no real title available?)
• Strict sequential P-completeness
• Average-Case Completeness in Tag Systems
• On the average complexity of the $k$-level
• Collapsing and separating completeness notions under average-case and worst-case hypotheses

This page was built for publication: On the Average Case Complexity of Some P-complete Problems

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