3 ms·
You agree that set lookup is O(1) and we need to do it N times, right?
by raldi 6y ago
You agree that set lookup is O(1) and we need to do it N times, right?
- YeGoblynQueenne 6y agoYep, my mistake. I was thinking of list lookups. I should have gone to bed :) In any case, even if it was O(n²) that's a polynomial time complexity and I don't see why BDDs are needed.