English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

This paper describes two families of canonical Reed-Muller forms, called inclusive forms (IFs) and their generalization, the generalized inclusive forms (GIFs), which include minimum ESOPs for any Boolean function. We outline the hierarchy of known canonical forms, in particular, pseudo-generalized Kronecker forms (PGKs), which led us to the discovery of the new families. Next, we introduce special binary trees, called the S/D trees, which underlie IFs and permit their enumeration. We show how to generate IFs and GIFs and prove that GIFs include minimum ESOPs. Finally, we present the results of computer experiments, which show that GIFs reduce the search space for minimum ESOP by several orders of magnitude, and this reduction grows exponentially with the number of variables

Generalized Inclusive Forms—New Canonical Reed-Muller Forms Including Minimum ESOPs