Hardness of approximation between P and NP

Author(s)

• Rubinstein, Aviad

Bibliographic Information

Hardness of approximation between P and NP

Aviad Rubinstein

（ACM books, #24）

Association for Computing Machinery , Morgan & Claypool Publishers, c2019

• : hardcover

Note

Revision of auther's thesis (Ph.D.)--University of California, Berkeley, 2017

Includes bibliographical references (p. [273]-290) and index

Details

• NCID: BB2923287X
• ISBN:
  • 9781947487239
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: [New York, N.Y.],[San Rafael, Calif.]
• Pages/Volumes: xv, 301 p.
• Size: 25 cm
• Classification:
  • DC23 : 511.352
• Subject Headings:
  • LCSH : NP-complete problems
  • LCSH : Equilibrium
  • LCSH : Computer algorithms
  • LCSH : Computational complexity
  • LCSH : Mathematical optimization
• Parent Bibliography ID:
  • BB21052069