Pages that link to "Item:Q1943910"

The following pages link to On complexity of a particular Boolean functions class (Q1943910):

Displaying 27 items.

• Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts (Q344027) (← links)
• The complexity of Boolean functions in different characteristics (Q626677) (← links)
• On the computational power of Boolean decision lists (Q853647) (← links)
• On the parity complexity measures of Boolean functions (Q974756) (← links)
• On the computational complexity of some classical equivalence relations on boolean functions (Q1272598) (← links)
• On the complexity of balanced Boolean functions (Q1606934) (← links)
• The class of 1-balanced functions and the complexity of its realization (Q1814332) (← links)
• Complexity of Boolean functions in the class of polarized polynomial forms (Q1918784) (← links)
• Computational bound on complexity of polynomial representations of Boolean functions (Q1943917) (← links)
• On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts (Q2018642) (← links)
• Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
• On the cardinality spectrum and the number of Latin bitrades of order 3 (Q2190924) (← links)
• On length of Boolean functions of a small number of variables in the class of pseudo-polynomials (Q2215245) (← links)
• Complexity lower bound for Boolean functions in the class of extended operator forms (Q2306843) (← links)
• Complexity of sequential implementation of partial Boolean functions (Q2377493) (← links)
• Complexity of Boolean functions' representations in classes of extended pair-generated operator forms (Q2633615) (← links)
• On the complexity of the evaluation of transient extensions of Boolean functions (Q2909178) (← links)
• On the positive and the inversion complexity of Boolean functions (Q3142263) (← links)
• On the complexity of Boolean functions with small number of ones (Q3409861) (← links)
• (Q3762226) (← links)
• (Q4036699) (← links)
• Local complexity of Boolean functions (Q4443562) (← links)
• On Deciding Whether a Boolean Function is Constant or Not (Q4819267) (← links)
• Boolean complexity classes vs. their arithmetic analogs (Q4894604) (← links)
• (Q5150421) (← links)
• Complexity of Linear Boolean Operators (Q5396765) (← links)
• The complexity of Boolean function implementation in some classes of automaton circuits (Q5947815) (← links)