"An NP-complete matching problem" - Information and Links:

An NP-complete matching problem - Info and Reading Options

Book's cover
The cover of “An NP-complete matching problem” - Open Library.

"An NP-complete matching problem" was published by Dept. of Computer Science, University of Illinois at Urbana-Champaign in 1979 - Urbana, it has 11 pages and the language of the book is English.


“An NP-complete matching problem” Metadata:

  • Title: ➤  An NP-complete matching problem
  • Author:
  • Language: English
  • Number of Pages: 11
  • Publisher: ➤  Dept. of Computer Science, University of Illinois at Urbana-Champaign
  • Publish Date:
  • Publish Location: Urbana

“An NP-complete matching problem” Subjects and Themes:

Edition Specifications:

  • Pagination: 11 p. :

Edition Identifiers:

AI-generated Review of “An NP-complete matching problem”:


Read “An NP-complete matching problem”:

Read “An NP-complete matching problem” by choosing from the options below.

Search for “An NP-complete matching problem” downloads:

Visit our Downloads Search page to see if downloads are available.

Borrow "An NP-complete matching problem" Online:

Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.

Find “An NP-complete matching problem” in Libraries Near You:

Read or borrow “An NP-complete matching problem” from your local library.

Buy “An NP-complete matching problem” online:

Shop for “An NP-complete matching problem” on popular online marketplaces.


Related Books

Related Ebooks

Source: The Open Library

E-Books

Related Ebooks from the Open Library and The Internet Archive.

1An NP-complete matching problem - Ebook

Book's cover

Please note that the files availability may be limited due to copyright restrictions.
Check the files availability here, with more info and coverage.

“An NP-complete matching problem - Ebook” Metadata:

  • Title: ➤  An NP-complete matching problem - Ebook
  • Publish Date:

Edition Identifiers: