scientific article; zbMATH DE number 4114026

zbMATH Open0679.68102MaRDI QIDQ4729359FDOQ4729359

Authors: Guido Walz 

Publication date: 1989

Title of this publication is not available (Why is that?)

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

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)

Cited In (6)

• Polynomial estimation of the complexity of algorithms
• Applications of parallel processors to some hard discrete problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)