Complexity Results of Persuasion
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909679375876096 |
|---|---|
| author | Grastien, Alban |
| author_facet | Grastien, Alban |
| contents | We prove that persuasion is an NP-complete problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_05951 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Complexity Results of Persuasion Grastien, Alban Computational Complexity Artificial Intelligence We prove that persuasion is an NP-complete problem. |
| title | Complexity Results of Persuasion |
| topic | Computational Complexity Artificial Intelligence |
| url | https://arxiv.org/abs/2507.05951 |