Formula Complexity of Ternary Majorities

DOI10.1007/978-3-642-32241-9_37MaRDI QIDQ2914347zbMATH OpenOpenAlexFDO

Authors Kenya Ueno

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32241-9_37

Mathematics Subject Classification ID

Boolean functions (06E30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computation complexity of a ternary linear function
• Cubic Formula Size Lower Bounds Based on Compositions with Majority
• A lower estimate for the computation complexity of a ternary linear function
• Complexity and Probability of Some Boolean Formulas
• scientific article; zbMATH DE number 1855658
• scientific article; zbMATH DE number 2070405
• scientific article; zbMATH DE number 1746570
• scientific article; zbMATH DE number 6963530
• On some interesting ternary formulas
• On some interesting ternary formulas

Cited in

(3)

• Pairs of majority-decomposing functions
• Formula complexity of a linear function in a \(k\)-ary basis
• scientific article; zbMATH DE number 3893098 (Why is no real title available?)

This page was built for publication: Formula Complexity of Ternary Majorities

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