Pages that link to "Item:Q677991"

The following pages link to Using amplification to compute majority with small majority gates (Q677991):

Displaying 5 items.

• A characteristic polynomial (Q1186974) (← links)
• Formula complexity of a linear function in a \(k\)-ary basis (Q2037681) (← links)
• On the complexity of the clone membership problem (Q2048213) (← links)
• Associative and commutative tree representations for Boolean functions (Q2514128) (← links)
• The fraction of large random trees representing a given Boolean function in implicational logic (Q2884007) (← links)