scientific article; zbMATH DE number 4209586

MaRDI QIDQ3357532zbMATH OpenFDO

Authors Christoph Meinel

Publication date 1987

zbMATH Keywords

graph accessibility problemsnonuniform complexity classes

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 17815
• Problems complete for deterministic logarithmic space
• scientific article; zbMATH DE number 4041256
• scientific article; zbMATH DE number 3987266
• scientific article; zbMATH DE number 4055051

Cited in

(6)

• Completeness and non-completeness results with respect to read-once projections
• scientific article; zbMATH DE number 3987266 (Why is no real title available?)
• Problems complete for deterministic logarithmic space
• scientific article; zbMATH DE number 4055051 (Why is no real title available?)
• scientific article; zbMATH DE number 8782 (Why is no real title available?)
• scientific article; zbMATH DE number 17815 (Why is no real title available?)

This page was built for publication:

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