Reputation
Top tag
Next privilege 125 Rep.
Vote down
Badges
2
Newest
 Scholar
Impact
~67 people reached

  • 0 posts edited
  • 0 helpful flags
  • 0 votes cast
Oct
13
awarded  Scholar
Oct
13
accepted Formalize as combinatorics problem (get all sets that boolean sum == (1,1,1))
Jun
10
comment Formalize as combinatorics problem (get all sets that boolean sum == (1,1,1))
Belgi, I want to get some sort of formula that might be useful in math representation of algorithm
Jun
10
revised Formalize as combinatorics problem (get all sets that boolean sum == (1,1,1))
added 24 characters in body
Jun
10
comment Formalize as combinatorics problem (get all sets that boolean sum == (1,1,1))
Henry, sorry again!) I've decided that it's not so important to have lots of repetitive elements, couse their summed reliability (additional properties out of the question scope) will be lower anyway.
Jun
10
awarded  Editor
Jun
10
revised Formalize as combinatorics problem (get all sets that boolean sum == (1,1,1))
added 150 characters in body
Jun
10
comment Formalize as combinatorics problem (get all sets that boolean sum == (1,1,1))
Henry, sorry I didn't quite fully described problem. I want to have as little as possible of repetitive elements, that have 1 on same position.
Jun
10
asked Formalize as combinatorics problem (get all sets that boolean sum == (1,1,1))