On realization of Boolean functions by formulae without repetitions

DOI10.1515/DMA.1995.5.4.347MaRDI QIDQ4856999zbMATH OpenOpenAlexFDO

Authors Nikolay A. Peryazev

Publication date 15 January 1996

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1995.5.4.347

zbMATH Keywords

algorithmBoolean functionsformulae without repetitions

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• On realization of Boolean functions by repetition-free formulas
• Realization of Boolean functions by repetition-free formulas in a particular base
• On the complexity of realization of Boolean functions by formulas
• Realization of Boolean functions by formulas in continuous bases containing a continuum of constants
• On the Boolean functions without upper bijunctive analogues
• scientific article; zbMATH DE number 4091416
• scientific article; zbMATH DE number 3672216
• scientific article; zbMATH DE number 4106931
• Complexity of implementation of Boolean functions by real-valued formulas

Cited in

(8)

• Recognizing the presence of a growing unessential argument of Boolean functions
• Testing of read-once functions in extended elementary bases
• On read-once functions over \(\mathbb{Z}_3\)
• On repetition-free Boolean functions over pre-elementary monotone bases
• On some series of bases for the set of Boolean functions
• scientific article; zbMATH DE number 5077425 (Why is no real title available?)
• scientific article; zbMATH DE number 4106931 (Why is no real title available?)
• scientific article; zbMATH DE number 3394051 (Why is no real title available?)

This page was built for publication: On realization of Boolean functions by formulae without repetitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4856999)