Complexity theory and algorithms

DOI10.1007/3-540-45706-2_51MaRDI QIDQ4813062zbMATH OpenFDO

Authors Ernst W. Mayr

Publication date 12 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2400/24000391.htm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 4037239
• scientific article; zbMATH DE number 1163093
• scientific article; zbMATH DE number 3970105
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Parallel computations on graphs

Cited in

(3)

• Operational complexity and pumping lemmas
• Theory of Computational Complexity
• scientific article; zbMATH DE number 2212170 (Why is no real title available?)

This page was built for publication: Complexity theory and algorithms

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