Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On realization of Boolean functions by formulae without repetitions

From MaRDI portal
Publication:4856999
Jump to:navigation, search

DOI10.1515/dma.1995.5.4.347zbMath0832.06012OpenAlexW1975846921MaRDI QIDQ4856999

Nikolaĭ Alekseevich 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)


Related Items (4)

On some series of bases for the set of Boolean functions ⋮ On repetition-free Boolean functions over pre-elementary monotone bases ⋮ On read-once functions over \(\mathbb{Z}_3\) ⋮ Testing of read-once functions in extended elementary bases







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4856999&oldid=19207032"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 03:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki