Computer-Sciecne

Pages in this section

  • Conjunctive normal form (CNF)
    Last edited: 2023-11-11

    A Boolean function is in conjunctive normal form if it is a collection of or statements unified by and operations. The or statements can contain negated variables but no further nesting.

    The following are in CNF:

    • $A$,
    • $(A \lor B)$,
    • $(A) \land (B)$,
    • $(A \lor B) \land (A)$,
    • $\lnot A$ , and
    • $(A \lor \lnot B \lor \lnot C) \land (\lnot D \lor E \lor F)$.

    The following are not in CNFL:

  • Distributed algorithm
    Last edited: 2026-02-05

    Distributed algorithm

    A distributed algorithm is a method used to solve a computational problem across multiple interconnected processors or nodes that communicate and coordinate with each other through message passing. Unlike centralized algorithms, which operate on a single processor, distributed algorithms function in environments where data and computational tasks are distributed among various locations, often without a central authority.