Complexity Results of Persuasion
Computational Complexity
2025-07-09 v1 Artificial Intelligence
Authors:
Alban Grastien
Abstract
We prove that persuasion is an NP-complete problem.
Keywords
Cite
@article{arxiv.2507.05951,
title = {Complexity Results of Persuasion},
author = {Alban Grastien},
journal= {arXiv preprint arXiv:2507.05951},
year = {2025}
}
Related papers
View all related →
Representation Theory · Mathematics
The Quiver Problem is NP Complete
Victor Kac, Bangzheng Li
2025-08-06
Computational Complexity · Computer Science
An NL-Complete Puzzle
Holger Petersen
2015-07-13
Computational Complexity · Computer Science
P=NP
Selmer Bringsjord, Joshua Taylor
2007-05-23
Group Theory · Mathematics
Quadratic equations over free groups are NP-complete
O. Kharlampovich, I. G. Lysenok, A. G Myasnikov, N. W. M. Touikan
2014-03-27
Optimization and Control · Mathematics
Self-concordance is NP-hard
Lek-Heng Lim
2013-04-01
Computational Complexity · Computer Science
$P\not=NP$ relative to a $P$-complete oracle
Reiner Czerwinski
2023-05-04
Computational Complexity · Computer Science
The Complexity of Some Combinatorial Puzzles
Holger Petersen
2015-08-03
Logic in Computer Science · Computer Science
The Completeness of Propositional Resolution: A Simple and Constructive<br> Proof
Jean Gallier
2017-01-11
Computational Complexity · Computer Science
Generic case completeness
Alexei Miasnikov, Alexander Ushakov
2016-06-06
Computational Complexity · Computer Science
The Problem of Computational Complexity
Rami Zaidan
2023-12-25
Logic in Computer Science · Computer Science
Proof compression and NP versus PSPACE. Part 2
Lev Gordeev
2022-01-11
Computational Complexity · Computer Science
The Packed Interval Covering Problem is NP-complete
Abdallah Saffidine, Sébastien Lê Cong, Sophie Pinchinat, François Schwarzentruber
2019-06-11
Logic in Computer Science · Computer Science
Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
Aleksi Anttila, Juha Kontinen, Fan Yang
2026-05-25
Logic in Computer Science · Computer Science
Satisfiability for Knowing How over Linear Plans is NP-complete
Carlos Areces, Pablo Barceló, Valentin Cassano, Pablo F. Castro +2
2026-05-20
Computational Geometry · Computer Science
Recognition of collapsible complexes is NP-complete
Martin Tancer
2015-10-08
Computational Complexity · Computer Science
NP-completeness Proof: RBCDN Reduction Problem
Sujogya Banerjee, Shahrzad Shirazipourazad, Pavel Ghosh, Arunabha Sen
2010-12-13
cmp-lg · Computer Science
The Complexity of Recognition of Linguistically Adequate Dependency Grammars
Peter Neuhaus, Norbert Broeker
2008-02-03
Artificial Intelligence · Computer Science
A Logic for Reasoning about Upper Probabilities
Joseph Y. Halpern, Riccardo Pucella
2014-08-08
Computational Complexity · Computer Science
A Proof for P =? NP Problem
Changlin Wan, Zhongzhi Shi
2020-07-02
Computational Complexity · Computer Science
P is a proper subset of NP
Jerrald Meek
2008-09-07
Formal Languages and Automata Theory · Computer Science
Diverse Palindromic Factorization is NP-Complete
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Karkkainen +4
2020-12-15
Artificial Intelligence · Computer Science
A logic for reasoning about upper probabilities
Joseph Y. Halpern, Riccardo Pucella
2007-05-23
Logic · Mathematics
Incompleteness in the finite domain
Pavel Pudlak
2017-05-22
Computational Complexity · Computer Science
A Proof of the CSP Dichotomy Conjecture
Dmitriy Zhuk
2020-10-05
Computational Complexity · Computer Science
Reachability Is NP-Complete Even for the Simplest Neural Networks
Marco Sälzer, Martin Lange
2022-03-16