<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Foundations of algorithms</title>
  </titleInfo>
  <name type="personal">
    <namePart>Neapolitan, Richard E.</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Naimipour, Kumarss.</namePart>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">bibliography</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">mau</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Sudbury, Mass</placeTerm>
    </place>
    <publisher>Jones and Bartlett Publishers</publisher>
    <dateIssued>c2011</dateIssued>
    <dateIssued encoding="marc">2011</dateIssued>
    <edition>4th ed.</edition>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>xv, 627 p. L ill. ; 24 cm.</extent>
  </physicalDescription>
  <tableOfContents>Algorithms: efficiency, analysis, and order -- Divide-and-conquer -- Dynamic programming -- The greedy approach -- Backtracking -- Branch-and-bound -- Introduction to computational complexity : the sorting problem -- More computational complexity : the searching problem -- Computational complexity and intractability : an introduction to the theory of NP -- Number-theoretic algorithms -- Introduction to parallel algorithms.</tableOfContents>
  <note type="statement of responsibility">Richard Neapoltian and Kumarss Naimipour.</note>
  <note>Rev. ed. of: Foundations of algorithms using C++ pseudocode. 3rd ed. c2004.</note>
  <note>Includes bibliographical references and index.</note>
  <subject authority="lcsh">
    <topic>Algorithms</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Constructive mathematics</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Computational complexity</topic>
  </subject>
  <classification authority="lcc">QA9.58 .N43 2011</classification>
  <classification authority="ddc" edition="22">518.1 NEF</classification>
  <relatedItem>
    <titleInfo>
      <title>Foundations of algorithms using C++ pseudocode</title>
    </titleInfo>
    <name type="personal">
      <namePart>Neapolitan, Richard E.</namePart>
    </name>
  </relatedItem>
  <identifier type="isbn">9780763782504 (casebound)</identifier>
  <identifier type="isbn">0763782505 (casebound)</identifier>
  <identifier type="lccn">2009040309</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">DLC</recordContentSource>
    <recordCreationDate encoding="marc">091009</recordCreationDate>
    <recordChangeDate encoding="iso8601">20140905083838.0</recordChangeDate>
    <recordIdentifier source="BD-DhUL">15938445</recordIdentifier>
  </recordInfo>
</mods>
