TechQA.

Question

Algorithm for comparing two sets of sets

score 21 · Answer 1 · 2024-03-20T14:45:38.560000

0

Answer

21

Views

Algorithm for comparing two sets of sets

21 views Asked by Brian T. Nix At 20 March 2024 at 14:45

score 81 · Answer 2 · 2024-03-09T15:57:27.173000

How to solve the problem of assigning products to assembly lines

81 views Asked by havish At 09 March 2024 at 15:57

score 18 · Answer 3 · 2024-03-04T20:35:32.770000

matrix not updating in knapsack algorithm

18 views Asked by Saif uz Zaman At 04 March 2024 at 20:35

score 145 · Answer 4 · 2023-11-18T20:16:12.420000

Constructing result for given word's order and overlapping in Shortest Superstring Problem

145 views Asked by Szyszka947 At 18 November 2023 at 20:16

score 106 · Answer 5 · 2023-11-14T14:35:30.090000

Maximum independet set of size >= |E|

106 views Asked by Joseph Jakl At 14 November 2023 at 14:35

score 77 · Answer 6 · 2023-10-14T13:17:45.890000

Example of 3CNF to Hitting set conversion

77 views Asked by Jellyfish At 14 October 2023 at 13:17

score 207 · Answer 7 · 2023-09-16T03:07:12.830000

Distributing marbles into buckets for maximal colour sharing

207 views Asked by NightShade At 16 September 2023 at 03:07

score 185 · Answer 8 · 2022-10-31T19:26:27.803000

Fast approximation of simple cases of relaxed bipartite dimension of graph problem

185 views Asked by Dimitrius At 31 October 2022 at 19:26

score 48 · Answer 9 · 2022-10-27T02:21:24.667000

How do we, or can we, show many-one reduction of 3-SAT to a decision problem X when X takes an input that itself is exponentially long?

48 views Asked by kerl_japan At 27 October 2022 at 02:21

score 60 · Answer 10 · 2022-10-09T22:54:41.943000

Use Dynamic Programming (memoization) to get this function below 2^n time complexity

60 views Asked by Tydal At 09 October 2022 at 22:54

score 579 · Answer 11 · 2022-09-29T09:56:53.810000

What is the difference between 1D-, 2D and 3D Bin packing problem?

579 views Asked by AIpython At 29 September 2022 at 09:56

score 65 · Answer 12 · 2022-08-18T04:35:31.633000

proof of SAT np completeness

65 views Asked by Mohsen Liaghat At 18 August 2022 at 04:35

score 109 · Answer 13 · 2022-08-12T17:24:59.900000

Pick subset of items minimizing the count of the most frequent of the selected item's labels

109 views Asked by Everyone_Else At 12 August 2022 at 17:24

score 61 · Answer 14 · 2022-08-12T02:17:59.933000

What problem type the Power Set belong to?

61 views Asked by Steven-Carrot At 12 August 2022 at 02:17

score 153 · Answer 15 · 2022-06-28T15:14:18.307000

Is this assignment problem with constrains NP-hard?

153 views Asked by Oscar At 28 June 2022 at 15:14

score 93 · Answer 16 · 2022-05-06T10:20:17.737000

Reasonable neighbours for a bees algorithm on a not-complete digraph

93 views Asked by Karol Szustakowski At 06 May 2022 at 10:20

score 226 · Answer 17 · 2022-04-25T20:05:54.337000

Is there an optimization problem that is NP-Complete?

226 views Asked by terra At 25 April 2022 at 20:05

score 219 · Answer 18 · 2022-01-26T14:09:16.547000

ILP in poly-time?

219 views Asked by Peter Chan At 26 January 2022 at 14:09

score 678 · Answer 19 · 2022-01-10T20:33:28.577000

Strategy for reducing CNF-SAT to this problem

678 views Asked by Danny Agir At 10 January 2022 at 20:33

score 514 · Answer 20 · 2022-01-08T16:47:31.457000

NP-hardness. Is it average case or worst-case?

514 views Asked by C.S. At 08 January 2022 at 16:47

TechQA.

List Question

Algorithm for comparing two sets of sets

How to solve the problem of assigning products to assembly lines

matrix not updating in knapsack algorithm

Constructing result for given word's order and overlapping in Shortest Superstring Problem

Maximum independet set of size >= |E|

Example of 3CNF to Hitting set conversion

Distributing marbles into buckets for maximal colour sharing

Fast approximation of simple cases of relaxed bipartite dimension of graph problem

How do we, or can we, show many-one reduction of 3-SAT to a decision problem X when X takes an input that itself is exponentially long?

Use Dynamic Programming (memoization) to get this function below 2^n time complexity

What is the difference between 1D-, 2D and 3D Bin packing problem?

proof of SAT np completeness

Pick subset of items minimizing the count of the most frequent of the selected item's labels

What problem type the Power Set belong to?

Is this assignment problem with constrains NP-hard?

Reasonable neighbours for a bees algorithm on a not-complete digraph

Is there an optimization problem that is NP-Complete?

ILP in poly-time?

Strategy for reducing CNF-SAT to this problem

NP-hardness. Is it average case or worst-case?

Popular Questions

Trending Questions