Iteration-free decomposition of strongly dependent functions

DOI10.1163/1569392042572159MaRDI QIDQ3409843zbMATH OpenOpenAlexFDO

Authors A. V. Cheremushkin

Publication date 20 November 2006

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

zbMATH Keywords

Boolean functionsstrongly dependent functionsiteration-free decompositions\(n\)-quasigroupsautotopy groupsisostrophy groups

Mathematics Subject Classification ID

Boolean functions (06E30) (n)-ary systems ((nge 3)) (20N15)

Recommendations

• scientific article; zbMATH DE number 3948231
• Partially invertible strongly dependent \(n\)-ary operations
• Decompositions of functions based on arity gap
• On strongly essential systems of functions in P k
• On linear decomposition of Boolean functions

Cited in

(8)

• Medial strongly dependent n-ary operations
• On read-once functions over \(\mathbb{Z}_3\)
• Analogues of Gluskin-Hosszú and Malyshev theorems for strongly dependent \(n\)-ary operations
• scientific article; zbMATH DE number 3948231 (Why is no real title available?)
• FUNCTIONAL DECOMPOSABILITY CRITERIA FOR QUADRATIC THRESHOLD BOOLEAN FUNCTIONS
• On the existence of special nonlinear invariants for round functions of XSL-ciphers
• Medial and paramedial general identities for strong dependance operations
• A functional identity of generalized transitivity for strongly dependent operations

This page was built for publication: Iteration-free decomposition of strongly dependent functions

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