Foundations of algorithms: using C++ pseudocode

zbMATH Open1227.68001MaRDI QIDQ3095475FDOQ3095475

Authors: Richard E. Neapolitan, K. Naimipour 

Publication date: 2 November 2011

Recommendations

• Foundations of algorithms
• Techniques for designing and analyzing algorithms
• scientific article; zbMATH DE number 2343061
• Algorithm design: Foundations, analysis, and Internet examples
• Introduction to algorithms

zbMATH Keywords

computational complexitydynamic programminggreedy algorithmsdivide-and-conquerbranch-and-bound algorithmscomplexity analysis of algorithmsbacktracking algorithmsdesigning algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Parallel algorithms in computer science (68W10) General topics in the theory of algorithms (68W01)

Cited In (4)

• Title not available (Why is that?)
• Incremental Pseudo Rectangular Organization of Information Relative to a Domain
• Algorithms. Design techniques and analysis
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems

This page was built for publication: Foundations of algorithms: using C++ pseudocode

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