Pith. sign in

The canonical form for h(f,g ) is then obtained by applying the CLEAN operation to the resulting BMP of Eq

Direct product Starting with the Shannon expansion of the function h(f,g ), we write h(f,g ) =f(x)g(x)h(0, 0) +f(x)g(x)h(0, 1) +f(x)g(x)h(1, 0) +f(x)g(x)h(1, 1) = h f(x) f(x) ⊗ g(x

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.DS 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

A Matrix Product State Representation of Boolean Functions

cs.DS · 2025-05-03 · conditional · novelty 5.0

A matrix-product (tensor-train-like) representation of Boolean functions, built from row-switching matrices, is proven to be a canonical normal form equivalent to quasi-reduced binary decision diagrams.

citing papers explorer

Showing 1 of 1 citing paper.

  • A Matrix Product State Representation of Boolean Functions cs.DS · 2025-05-03 · conditional · none · ref 3

    A matrix-product (tensor-train-like) representation of Boolean functions, built from row-switching matrices, is proven to be a canonical normal form equivalent to quasi-reduced binary decision diagrams.