On the complexity of Boolean functions with small number of ones

From MaRDI portal

Revision as of 17:49, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:3409861

Jump to:navigation, search

DOI10.1163/1569392043272511zbMath1104.94068OpenAlexW2079867592MaRDI QIDQ3409861

Nikolay P. Red'kin

Publication date: 20 November 2006

Full work available at URL: https://doi.org/10.1163/1569392043272511

zbMATH Keywords

minimal circuits Finikov method

Mathematics Subject Classification ID

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

Related Items (2)

Asymptotics for the complexity of Boolean functions with small number of ones ⋮ Implementation complexity of Boolean functions with a small number of ones

This page was built for publication: On the complexity of Boolean functions with small number of ones

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

Pages with script errors