Theory of computational complexity /

Theory of computational complexity / / Ding-Zhu Du, Ker-I Ko.

Saved in:
Bibliographic Details
Superior document:Wiley Series in Discrete Mathematics and Optimization
VerfasserIn:
Du, Dingzhu,
Ko, Ker-I,
TeilnehmendeR:
Ko, Ker-I,
Place / Publishing House:Hoboken, New Jersey : : Wiley,, 2014.
2014
Year of Publication:2014
Edition:Second edition.
Language:English
Series:Wiley series in discrete mathematics and optimization.
Online Access:
Physical Description:1 online resource (514 pages) :; illustrations.
Tags: Add Tag
No Tags, Be the first to tag this record!
id 5001695068
ctrlnum (MiAaPQ)5001695068
(Au-PeEL)EBL1695068
(CaPaEBR)ebr10876079
(CaONFJC)MIL613400
(OCoLC)880827316
collection bib_alma
record_format marc
spelling Du, Dingzhu, author.
Theory of computational complexity / Ding-Zhu Du, Ker-I Ko.
Second edition.
Hoboken, New Jersey : Wiley, 2014.
2014
1 online resource (514 pages) : illustrations.
text rdacontent
computer rdamedia
online resource rdacarrier
Wiley Series in Discrete Mathematics and Optimization
Includes bibliographical references and index.
Description based on print version record.
Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.
Computational complexity.
Electronic books.
Ko, Ker-I, author.
Print version: Du, Dingzhu. Theory of computational complexity. Second edition. Hoboken, New Jersey : Wiley, c2014 xv, 494 pages Wiley series in discrete mathematics and optimization. 9781118306086 2013047839
ProQuest (Firm)
Wiley series in discrete mathematics and optimization.
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=1695068 Click to View
language English
format eBook
author Du, Dingzhu,
Ko, Ker-I,
spellingShingle Du, Dingzhu,
Ko, Ker-I,
Theory of computational complexity /
Wiley Series in Discrete Mathematics and Optimization
author_facet Du, Dingzhu,
Ko, Ker-I,
Ko, Ker-I,
author_variant d d dd
k i k kik
author_role VerfasserIn
VerfasserIn
author2 Ko, Ker-I,
author2_role TeilnehmendeR
author_sort Du, Dingzhu,
title Theory of computational complexity /
title_full Theory of computational complexity / Ding-Zhu Du, Ker-I Ko.
title_fullStr Theory of computational complexity / Ding-Zhu Du, Ker-I Ko.
title_full_unstemmed Theory of computational complexity / Ding-Zhu Du, Ker-I Ko.
title_auth Theory of computational complexity /
title_new Theory of computational complexity /
title_sort theory of computational complexity /
series Wiley Series in Discrete Mathematics and Optimization
series2 Wiley Series in Discrete Mathematics and Optimization
publisher Wiley,
publishDate 2014
physical 1 online resource (514 pages) : illustrations.
edition Second edition.
isbn 9781118593035
9781118306086
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA267
callnumber-sort QA 3267.7 D8 42014
genre Electronic books.
genre_facet Electronic books.
url https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=1695068
illustrated Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 511 - General principles of mathematics
dewey-full 511.3/52
dewey-sort 3511.3 252
dewey-raw 511.3/52
dewey-search 511.3/52
oclc_num 880827316
work_keys_str_mv AT dudingzhu theoryofcomputationalcomplexity
AT kokeri theoryofcomputationalcomplexity
status_str n
ids_txt_mv (MiAaPQ)5001695068
(Au-PeEL)EBL1695068
(CaPaEBR)ebr10876079
(CaONFJC)MIL613400
(OCoLC)880827316
hierarchy_parent_title Wiley Series in Discrete Mathematics and Optimization
is_hierarchy_title Theory of computational complexity /
container_title Wiley Series in Discrete Mathematics and Optimization
author2_original_writing_str_mv noLinkedField
_version_ 1792330779992260609
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01881nam a2200457 i 4500</leader><controlfield tag="001">5001695068</controlfield><controlfield tag="003">MiAaPQ</controlfield><controlfield tag="005">20200520144314.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cnu||||||||</controlfield><controlfield tag="008">140615t20142014njua ob 001 0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781118306086</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118593035</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)5001695068</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL1695068</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaPaEBR)ebr10876079</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaONFJC)MIL613400</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)880827316</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA267.7</subfield><subfield code="b">.D8 2014</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/52</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Du, Dingzhu,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Theory of computational complexity /</subfield><subfield code="c">Ding-Zhu Du, Ker-I Ko.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second edition.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, New Jersey :</subfield><subfield code="b">Wiley,</subfield><subfield code="c">2014.</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (514 pages) :</subfield><subfield code="b">illustrations.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Wiley Series in Discrete Mathematics and Optimization</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on print version record.</subfield></datafield><datafield tag="590" ind1=" " ind2=" "><subfield code="a">Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computational complexity.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ko, Ker-I,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Du, Dingzhu.</subfield><subfield code="t">Theory of computational complexity.</subfield><subfield code="b">Second edition.</subfield><subfield code="d">Hoboken, New Jersey : Wiley, c2014 </subfield><subfield code="h">xv, 494 pages </subfield><subfield code="k">Wiley series in discrete mathematics and optimization.</subfield><subfield code="z">9781118306086 </subfield><subfield code="w">2013047839</subfield></datafield><datafield tag="797" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Wiley series in discrete mathematics and optimization.</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=1695068</subfield><subfield code="z">Click to View</subfield></datafield></record></collection>

Similar Items