Let S = { trigon, tetragon , pentagon , ... ,... } is a set of polygons How to calculate intersection of subsets of (every element actually) Powerset(S) Powerset(S) =[ {} , {trigon} , {tetragon} , {pentagon} , {trigon, tetragon} , {trigon,pentagon} ,......] for i in Powerset(S) find intersect(i…

Find the intersection of elements of powerset one by one

XLVII December 8, 2021, 3:00pm 3

Can you say something about time complexity?

Topic		Replies	Views
Intersect() is slow for large arrays General Usage	5	3110	November 21, 2016
True power set of a set is slower than power array of array Performance	3	750	April 17, 2021
Generate all subsets of a set General Usage first-steps , optimization	13	10771	October 13, 2019
`issubset(::BitSet,::BitSet)` is slow and allocates unnecessarily Performance	1	478	August 2, 2020
Fast String processing in Julia vs. Python General Usage	38	7053	March 7, 2017