Question

How do you turn a proof of a mathematical statement into a zero-knowledge proof?

score 691 · Answer 1 · 2021-02-14 18:13:57

691

Views

How do you turn a proof of a mathematical statement into a zero-knowledge proof?

Published on 14 Feb 2021 - 18:13

score 57 · Answer 2 · 2021-02-16 09:18:48

57

Views

The concept of the creation of a trapdoor in NP-complete or NP-hard problems

Published on 16 Feb 2021 - 9:18

score 58 · Answer 3 · 2021-02-27 16:09:20

58

Views

Min Max diameter of subgraphs from a given graph.also given the number of subgraphs.

Published on 27 Feb 2021 - 16:09

score 36 · Answer 4 · 2021-03-11 01:58:32

36

Views

Split $\{1,2,...,n\}$ into $k$ subsets so that the sum of the elements in each subset are as close as possible.

Published on 11 Mar 2021 - 1:58

score 165 · Answer 5 · 2026-03-27 06:13:19

165

Views

Clique cover problem with general clique weights

Published on 27 Mar 2026 - 6:13

score 80 · Answer 6 · 2021-04-06 21:00:13

80

Views

Is there a "common" name for this type of combinatorial optimization problem?

Published on 06 Apr 2021 - 21:00

score 112 · Answer 7 · 2026-02-23 13:35:37

112

Views

NP Hardness of odd degree subgraph problem

Published on 23 Feb 2026 - 13:35

score 59 · Answer 8 · 2021-04-25 13:03:39

59

Views

NP-complete decision problems

Published on 25 Apr 2021 - 13:03

score 11 · Answer 9 · 2021-04-29 09:48:34

11

Views

Find Extremal Point over a Set of all Simple Cycle in a Directed Graph

Published on 29 Apr 2021 - 9:48

score 89 · Answer 10 · 2026-03-27 14:10:50

89

Views

Show if the IS is NP-Complete

Published on 27 Mar 2026 - 14:10

score 44 · Answer 11 · 2021-05-18 12:46:41

44

Views

Coloring agents on a graph s.th. everyone has at least one friend as neighbor

Published on 18 May 2021 - 12:46

score 55 · Answer 12 · 2026-03-28 06:05:54

55

Views

Sub-graph Selection Algorithm Problem (Dynamic Programming or NP)

Published on 28 Mar 2026 - 6:05

score 54 · Answer 13 · 2021-05-25 05:37:05

54

Views

Selecting one element from each of many sets such that no two elements are equal.

Published on 25 May 2021 - 5:37

score 98 · Answer 14 · 2021-05-30 19:22:00

98

Views

For my algorithm, is there some function that will tell me exactly when my list of 3-sets will probably have an exact-cover?

Published on 30 May 2021 - 19:22

score 156 · Answer 15 · 2021-06-22 14:53:05

156

Views

The Set Cover Problem, but instead of solving for when the Union of subsets of S is U, I want the union to be or contain a specific subset of U.

Published on 22 Jun 2021 - 14:53

List Question

How do you turn a proof of a mathematical statement into a zero-knowledge proof?

The concept of the creation of a trapdoor in NP-complete or NP-hard problems

Min Max diameter of subgraphs from a given graph.also given the number of subgraphs.

Split $\{1,2,...,n\}$ into $k$ subsets so that the sum of the elements in each subset are as close as possible.

Clique cover problem with general clique weights

Is there a "common" name for this type of combinatorial optimization problem?

NP Hardness of odd degree subgraph problem

NP-complete decision problems

Find Extremal Point over a Set of all Simple Cycle in a Directed Graph

Show if the IS is NP-Complete

Coloring agents on a graph s.th. everyone has at least one friend as neighbor

Sub-graph Selection Algorithm Problem (Dynamic Programming or NP)

Selecting one element from each of many sets such that no two elements are equal.

For my algorithm, is there some function that will tell me exactly when my list of 3-sets will probably have an exact-cover?

The Set Cover Problem, but instead of solving for when the Union of subsets of S is U, I want the union to be or contain a specific subset of U.

Trending Questions

Popular # Hahtags

Popular Questions