arXiv (All)
open access
Block Sensitivity and Certificate Complexity of Rotation Symmetric Boolean Functions
We study block sensitivity and certificate complexity of rotation symmetric Boolean functions, with particular emphasis on monomial rotation symmetric Boolean functions. We first show that every odd-degree monomial rotation symmetric Boolean function on $n$ variables satisfies $s=bs=C=n$. We then de
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sensitivity of Rotation Symmetric Boolean Functions via Binary Necklaces#1341887
- Vanishing Ideals and the Computational Tractability of Sum-of-Squares over Boolean Domains#1142234
- The Komlós Problem in Matrix-Multiplication Time#1356331
- Perfect Combinatorial Structures in Coding Theory and Cryptography#1069934
- Some t-homogeneous sets of permutations#1089333
Record · ID 1341980
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive