01883nam a2200445 i 4500 EBC6954888 MiAaPQ 20250828022237.0 m o d | cr cnu|||||||| 241118s2019 xx ob 001 0 eng d 9781947487208 (print) 9781947487215 (electronic bk.) (MiAaPQ)EBC6954888 (Au-PeEL)EBL6954888 (OCoLC)1314613851 MiAaPQ eng rda pn MiAaPQ MiAaPQ QA269 .R835 2019 519.3 23 Rubinstein, Aviad, author. 731351 Hardness of Approximation Between P and NP / Aviad Rubinstein. First edition. [Place of publication not identified] : Association for Computing Machinery, [2019] �2019 1 online resource (xvi, 303 pages). text txt rdacontent computer c rdamedia online resource cr rdacarrier ACM books ; Number 24 Includes bibliographical references and index. Description based on print version record. Electronic reproduction. Ann Arbor, MI : ProQuest, 2018. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. Game theory. Programming (Mathematics) Electronic books. 35142 Print version: Rubinstein, Aviad. Hardness of Approximation Between P and NP. First edition. [Place of publication not identified] : Association for Computing Machinery, c2019 xvi, 303 pages ACM books ; Number 24. 9781947487208 ProQuest (Firm) ACM books ; Number 24. 731352 https://ebookcentral.proquest.com/lib/kuct-ebooks/detail.action?docID=6954888 Click to View 371443 371443