Complexity Results of Persuasion
We prove that persuasion is an NP-complete problem.
We prove that persuasion is an NP-complete problem.
These charts contain model-linked results. The charts above also include unlinked source profiles. Compare scores within each evaluation. Model quality, usage, transparency and system performance measure different things.