<?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>Computer and intracability</title>
    <subTitle>a guide to the theory of NP-completness</subTitle>
  </titleInfo>
  <name type="personal">
    <namePart>Garey, Michael R. David S. Johnson</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="text">New York</placeTerm>
    </place>
    <publisher>Freeman and company</publisher>
    <dateIssued>1979</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <physicalDescription>
    <extent>ix, 339 p. : ill. ; 23cm.</extent>
  </physicalDescription>
  <subject>
    <topic>Electronic digital computers</topic>
    <topic>Algorithms</topic>
    <topic>Programming</topic>
    <topic>NP-hardness</topic>
    <topic>Graph theory</topic>
    <topic>Language theory</topic>
    <topic>Automata theory</topic>
    <topic>Program optimization</topic>
    <topic>FEAS</topic>
  </subject>
  <classification authority="ddc">519.4 GAR</classification>
  <identifier type="isbn">9780716710448 (hbk)</identifier>
  <recordInfo/>
</mods>
