Journal Article

Dealing with NP-completeness

  • Algorithms A
Spring (2005) 1-4
N/ACitations
Citations of this article
23Readers
Mendeley users who have this article in their library.

Cite

CITATION STYLE

APA

Algorithms, A. (2005). Dealing with NP-completeness. Spring, 1–4.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free