{"ID":2897033,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.05951","arxiv_id":"2507.05951","title":"Complexity Results of Persuasion","abstract":"We prove that persuasion is an NP-complete problem.","short_abstract":"We prove that persuasion is an NP-complete problem.","url_abs":"https://arxiv.org/abs/2507.05951","url_pdf":"https://arxiv.org/pdf/2507.05951v1","authors":"[\"Alban Grastien\"]","published":"2025-07-08T12:49:22Z","proceeding":"cs.CC","tasks":"[\"cs.CC\",\"cs.AI\"]","methods":"[]","has_code":false}