Tag np-hard - Это страница 2 - GeneraCodice

max-weight k-clique in a complete k-partite graph

https://www.generacodice.com/ru/articolo/8384952/max-weight-k-clique-in-a-complete-k-partite-graph

algorithm - complexity-theory - np-hard - clique-problem

Boolean formula encoding

https://www.generacodice.com/ru/articolo/7330570/boolean-formula-encoding

math - np-complete - satisfiability - np-hard - np

Where to find a set of hard Traveling Salesman Problems (with known solutions/approximations)?

https://www.generacodice.com/ru/articolo/6756046/where-to-find-a-set-of-hard-traveling-salesman-problems-with-known-solutions-approximations

algorithm - language-agnostic - np-complete - np-hard - traveling-salesman

NP hard but not NPC

https://www.generacodice.com/ru/articolo/5449385/np-hard-but-not-npc

np-complete - scheduling - np-hard - np

When NP complete becomes NP hard

https://www.generacodice.com/ru/articolo/5394923/when-np-complete-becomes-np-hard

np-complete - np-hard - np

Expression from an array of numbers

https://www.generacodice.com/ru/articolo/5214488/expression-from-an-array-of-numbers

math - algorithm - data-structures - np-hard - np

How can I reduce this kind of BinPack algorithm? (It might be called sth like MinBreak-BinFill.)

https://www.generacodice.com/ru/articolo/5211758/how-can-i-reduce-this-kind-of-binpack-algorithm-it-might-be-called-sth-like-minbreak-binfill

algorithm - optimization - np-hard

Can it be proven no polynomial algorithm exists for an NP-Complete prob.?

https://www.generacodice.com/ru/articolo/5010263/can-it-be-proven-no-polynomial-algorithm-exists-for-an-np-complete-prob

np-complete - np-hard - np

Relationship between NP-hard and undecidable problems

https://www.generacodice.com/ru/articolo/4230213/relationship-between-np-hard-and-undecidable-problems

algorithm - np-hard - decidable

Np-hardness reduction

https://www.generacodice.com/ru/articolo/3437803/np-hardness-reduction

algorithm - np-complete - np-hard - np

«
1
2
3
4
5
6
»

Результаты найдены: 647