Matheson Library

Empowering Knowledge, Inspiring Discovery

Welcome to the Matheson Library

Explore our vast collection of resources.

Learn and Grow

Your journey to knowledge starts here.

Connect with Us

Join the Matlis community for lifelong learning.

Discover New Worlds

Books that inspire and empower.

Digital Resources

Access journals, articles, and more.

Collaborate and Innovate

Spaces designed for teamwork.

Events and Workshops

Learn from experts and peers.

History and Heritage

Preserving stories and memories.

Our Mission

Empowering education for all.

Future Ready

Building knowledge for tomorrow.

Normal view MARC view ISBD view

Computers and intractability a guide to the theory of NP-completeness

Garey, Michael R.

Computers and intractability a guide to the theory of NP-completeness Michael R. Garey, David S. Johnson - San Francisco W. H. Freeman c1979 - x, 338 p. ill 24 cm. - A Series of books in the mathematical sciences .

Subjects--Topical Terms:
Algorithms
Computational complexity
Computer programming

Dewey Class. No.: 519.4