Lookup Table: Difference between revisions
Created page with "{{stub}} Any arbitrary logic formula can, theoretically, always be represented in Conjunctive Normal Form. Put in simple terms, this means the output is computed using a single OR-operation, whose inputs are formed by AND gates, which directly use (possibly negated) inputs. == Complexity == When following the usual arrangement <math>\mathcal{O}(n \cdot \frac{n}{2}) = \mathcal{O}(n^2)</math>" |
(No difference)
|
Revision as of 09:11, 6 September 2025
Any arbitrary logic formula can, theoretically, always be represented in Conjunctive Normal Form. Put in simple terms, this means the output is computed using a single OR-operation, whose inputs are formed by AND gates, which directly use (possibly negated) inputs.
Complexity
When following the usual arrangement