The Quiver Problem is NP Complete
Representation Theory
2025-08-06 v1
Abstract
We prove that the quiver problem is NP complete.
Cite
@article{arxiv.2508.02975,
title = {The Quiver Problem is NP Complete},
author = {Victor Kac and Bangzheng Li},
journal= {arXiv preprint arXiv:2508.02975},
year = {2025}
}
Related papers
View all related →
Computational Complexity · Computer Science
Complexity Results of Persuasion
Alban Grastien
2025-07-09
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
Computational Complexity · Computer Science
P=NP
Selmer Bringsjord, Joshua Taylor
2007-05-23
Computational Complexity · Computer Science
Generic case completeness
Alexei Miasnikov, Alexander Ushakov
2016-06-06
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
Computational Complexity · Computer Science
Solution of the Linear Ordering Problem (NP=P)
Givi Bolotashvili
2007-05-23
Computational Complexity · Computer Science
An NL-Complete Puzzle
Holger Petersen
2015-07-13
Computational Geometry · Computer Science
On the complexity of covering points by guillotine cuts
Delia Garijo, Alberto Márquez, Rodrigo I. Silveira
2026-02-25
Computational Complexity · Computer Science
Transforming NP to P: An Approach to Solve NP Complete Problems
Wenhong Tian, GuoZhong Li, Xinyang Wang, Qin Xiong +1
2015-05-04
Computational Complexity · Computer Science
Exploring P versus NP
Jian-Gang Tang
2024-03-26
Computational Complexity · Computer Science
2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs
Erik D. Demaine, Kritkorn Karntikoon, Nipun Pitimanaaree
2023-09-19
Combinatorics · Mathematics
Matching sequences of two digits in matrices is hard
Nicolaos Matsakis
2011-07-05
Functional Analysis · Mathematics
Solution of the Ovals problem
Yacine Chitour, Jochen Denzler, Frédéric Jean, Emmanuel Trélat
2025-04-22
General Mathematics · Mathematics
On NP complete problems I
Minoru Fujimoto, Kunihiko Uehara
2012-12-29
Computational Complexity · Computer Science
Polynomially Correlated Knapsack is NP-complete
Chinmay Karande
2009-10-15
Classical Analysis and ODEs · Mathematics
"`Painleve 34"' equation: equivalence test
Vera V. Kartak
2014-07-15
Quantum Physics · Physics
A stochastic limit approach to the SAT problem
Luigi Accardi, Masanori Ohya
2007-05-23
Computational Complexity · Computer Science
Solving the Rubik's Cube Optimally is NP-complete
Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy
2018-04-30
Combinatorics · Mathematics
Every finite acyclic quiver is a full subquiver of a quiver mutation equivalent to a bipartite quiver
Kyungyong Lee
2013-11-14
Computational Complexity · Computer Science
On the Complexity of a Derivative Chess Problem
Barnaby Martin
2007-05-23
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
Computational Complexity · Computer Science
All Permutations Supersequence is coNP-complete
Przemysław Uznański
2015-07-10
Computational Complexity · Computer Science
The Complexity of Some Combinatorial Puzzles
Holger Petersen
2015-08-03
Computational Complexity · Computer Science
Mastermind is NP-Complete
Jeff Stuckman, Guo-Qiang Zhang
2007-05-23
Discrete Mathematics · Computer Science
Mixed-integer Quadratic Programming is in NP
Alberto Del Pia, Santanu S. Dey, Marco Molinaro
2014-07-21