Computational bound on complexity of polynomial representations of Boolean functions

From MaRDI portal

Revision as of 15:47, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1943917

Jump to:navigation, search

zbMath1271.94038MaRDI QIDQ1943917

Sergej Yur'evich Rejmerov, Alekseĭ Sergeevich Kazimirov

Publication date: 3 April 2013

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

zbMATH Keywords

genetic algorithms Boolean functions minimization exclusive-or-sum-of-products

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (1)

Complexity of Boolean functions' representations in classes of extended pair-generated operator forms

This page was built for publication: Computational bound on complexity of polynomial representations of Boolean functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1943917&oldid=14376401"

Pages with script errors