scientific article

From MaRDI portal

Revision as of 21:49, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3095475

Jump to:navigation, search

zbMath1227.68001MaRDI QIDQ3095475

Richard E. Neapolitan, K. Naimipour

Publication date: 2 November 2011

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexity dynamic programming greedy algorithms branch-and-bound algorithms divide-and-conquer complexity analysis of algorithms backtracking algorithms designing 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)

Related Items (2)

Incremental Pseudo Rectangular Organization of Information Relative to a Domain ⋮ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3095475&oldid=16167682"