https://panamahitek.com/tag/np-hard/
NP-Hard archivos - Panama Hitek
np hardarchivospanamahitek
https://ac.tuwien.ac.at/publication/clique-width-minimization-is-np-hard/
Clique-width Minimization is NP-hard | AC Group | TU Wien
Jan 1, 2006 - *Proceedings of STOC 2006; the 38th ACM Symposium on Theory of Computing, Seattle, Washington, USA*, pages 354–362, 2006, ACM.
clique widthnp hardtu wienminimizationgroup
https://list.iid.ciirc.cvut.cz/archives/list/schedulingseminar@rtime.felk.cvut.cz/thread/7P6QIEFCFTHTU5VUKJNK4HUWD5PUVF5U/
Martin Skutella (TU Berlin) | May 12 | Efficient Algorithms and Provably Good Solutions for NP-hard...
tu berlinnp hardmartinmayefficient
https://www.bigo.ooo/
Big O, Inc. // We Ain’t Just Tough We’re NP Hard
Big O, Inc. — We Ain’t Just Tough We’re NP Hard
big onp hardinctough
https://wiwi-gitlab.uni-muenster.de/explore/projects/topics/NP-hard%20problems?archived=true&language=33&sort=latest_activity_desc
NP-hard problems · Topics · GitLab
np hardproblemstopicsgitlab
https://wiwi-gitlab.uni-muenster.de/explore/projects/topics/NP-hard%20problems?language=61&sort=latest_activity_asc
NP-hard problems · Topics · GitLab
np hardproblemstopicsgitlab
https://bigo.ooo/
Big O, Inc. // We Ain’t Just Tough We’re NP Hard
Big O, Inc. — We Ain’t Just Tough We’re NP Hard
big onp hardinctough
https://arxiv.org/abs/2609.01469
[2609.01469] SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules
Abstract page for arXiv paper 2609.01469: SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules
np hardfor somesvprankcyclotomic
https://ucrisportal.univie.ac.at/en/publications/almost-complete-solution-for-the-np-hard-separability-problem-of-/
Almost complete solution for the NP-hard separability problem of Bell diagonal qutrits - University...
almost completesolution fornp hardseparability problembell
https://jgaa.info/index.php/jgaa/article/view/paper132/2841
View of Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
fixed point setnp hardviewplanarembeddability