Timeline for Fast algorithm for computing minimal closure of a set of sets under intersection?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 16, 2022 at 18:36 | answer | added | D.W.♦ | timeline score: 1 | |
| Mar 16, 2022 at 16:38 | history | edited | adamcatto | CC BY-SA 4.0 |
added 231 characters in body
|
| Mar 15, 2022 at 22:59 | comment | added | nir shahar | The result will literally be the set $S'$ containing all sets $s'$ of the form $s'=\bigcap s\in A$ for some $A\subseteq S'$. Since the output can be incredibely large, (up to an exponantial size in the input) - there is no "fast" algorithm for this problem. | |
| S Mar 15, 2022 at 19:12 | review | First questions | |||
| Mar 16, 2022 at 18:34 | |||||
| S Mar 15, 2022 at 19:12 | history | asked | adamcatto | CC BY-SA 4.0 |