Smallest Formulas for Parity of 2 k Variables Are Essentially Unique

DOI10.1007/978-3-540-69733-6_10zbMath1148.68373OpenAlexW171266665MaRDI QIDQ3511317

Jun Tarui

Publication date: 10 July 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_10

Mathematics Subject Classification ID

Related Items (1)

Smallest formulas for the parity of \(2^k\) variables are essentially unique

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improvements on Khrapchenko's theorem
• An extension of Khrapchenko's theorem
• The quantum adversary method and classical formula size power bounds
• Monotone Circuits for Connectivity Require Super-Logarithmic Depth
• The Shrinkage Exponent of de Morgan Formulas is 2
• Communication Complexity
• Computational Complexity

This page was built for publication: Smallest Formulas for Parity of 2 k Variables Are Essentially Unique