scientific article; zbMATH DE number 4114026

MaRDI QIDQ4729359zbMATH OpenFDO

Authors Guido Walz

Publication date 1989

zbMATH Keywords

parallelismcomputational complexity of algorithmsCPM method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99) Theory of operating systems (68N25)

Recommendations

• scientific article; zbMATH DE number 4037239
• Parallel computations on graphs
• scientific article; zbMATH DE number 4037190
• Polynomial estimation of the complexity of algorithms
• scientific article; zbMATH DE number 4074482

Cited in

(6)

• Applications of parallel processors to some hard discrete problems
• Polynomial estimation of the complexity of algorithms
• scientific article; zbMATH DE number 1830922 (Why is no real title available?)
• scientific article; zbMATH DE number 4037190 (Why is no real title available?)
• scientific article; zbMATH DE number 4104396 (Why is no real title available?)
• Complexity measures on systems of parallel algorithms

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 Q4729359)