Jump to content

Lookup Table

From Logic World Wiki
Revision as of 09:11, 6 September 2025 by GHXX (talk | contribs) (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>")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
This article is a stub. Please help expand it by adding content.

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

𝒪(nn2)=𝒪(n2)