NP-complet is the French translation of NP-complete, a term used to describe a class of problems in computer science for which we cannot currently produce a solution faster than in superpolynomial time but for which we can verify a solution in polynomial time.

It is currently unproven if we can or can’t find a solution to such problems faster than in superpolymonial time.

NP-complet is also the name of my Montreal based consulting business. For more information on the services I offer or to obtain my business phone number, please contact me at

Visit NP-complet’s website.
Follow NP-complet’s tumblr account.

2 thoughts on “NP-complet

  1. Il faut bien être un Leblanc pour parler de np-complétude et de prolog. Ma seul surprise est de ne pas voir Université de Montréal ;).

    Guy Leblanc

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s