## Independence of Clique Problems

**Authors:** Thinh Nguyen

A polynomial algorithm is “faster” than an exponential algorithm. As n grows an (exponential) always grows faster than nk (polynomial), i.e. for any values of a and k, after n> certain integer n0, it is true that an > nk. Even 2^n grows faster than n1000 at some large value of n. The former functions are exponential and the later functions are polynomial. It seems that for some problems we just may not have any polynomial algorithm at all (as in the information theoretic bound)! The theory of NPcompleteness is about this issue, and in general the computational complexity theory addresses it.

**Comments:** 27 Pages.

**Download:** **PDF**

### Submission history

[v1] 2018-06-22 07:08:11

**Unique-IP document downloads:** 48 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary.
In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution.
Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

**Add your own feedback and questions here:**

*You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.*

*
*