scientific article; zbMATH DE number 3976318

MaRDI QIDQ3741041zbMATH OpenFDO

Authors

Publication date 1985

zbMATH Keywords

approximation algorithmsarithmetic algorithmscombinatorial algorithmscomputational complexityefficient algorithmsFFTgraph algorithmsNP- complete problemspermutation generationprobabilistic algorithmsrecursive callstring matching

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 1805583
• scientific article; zbMATH DE number 194946
• scientific article; zbMATH DE number 4039250
• scientific article; zbMATH DE number 3887060
• Algorithms. Design and analysis

Cited in

(6)

• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• Algorithms and theory of computation handbook. General concepts and techniques.
• scientific article; zbMATH DE number 4039250 (Why is no real title available?)
• scientific article; zbMATH DE number 568873 (Why is no real title available?)
• scientific article; zbMATH DE number 194946 (Why is no real title available?)
• scientific article; zbMATH DE number 793950 (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 Q3741041)