P vs. NP
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2016
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908353186234368 |
|---|---|
| author | Uribe, Daniel |
| author_facet | Uribe, Daniel |
| contents | The method for analyzing algorithmic runtime complexity using decision trees is discussed using the sorting algorithm. This method is then extended to optimal algorithms which may find all cliques of size q in network N, or simply the first clique of size q in network N. Finally, the lower bound of such decision trees is demonstrated to not be in P. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1601_03619 |
| institution | arXiv |
| publishDate | 2016 |
| record_format | arxiv |
| spellingShingle | P vs. NP Uribe, Daniel Computational Complexity The method for analyzing algorithmic runtime complexity using decision trees is discussed using the sorting algorithm. This method is then extended to optimal algorithms which may find all cliques of size q in network N, or simply the first clique of size q in network N. Finally, the lower bound of such decision trees is demonstrated to not be in P. |
| title | P vs. NP |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/1601.03619 |