Algorithms. Design techniques and analysis

DOI10.1142/9804zbMATH Open1342.68001OpenAlexW4242393290MaRDI QIDQ5890565FDOQ5890565

M. H. Alsuwaiyel

Publication date: 8 April 2016

Published in: Lecture Notes Series on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9804

zbMATH Keywords

computational complexityanalysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algorithms in computer science (68Wxx)

Cited In (5)

• Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
• Algorithm design: Foundations, analysis, and Internet examples
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithm design for computer system design.

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Algorithmen und Datenstrukturen 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Algorithms. Design techniques and analysis

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