Instance complexity of symmetric Boolean functions is completely characterized with only Parity and complement at value 1; Greater-Than and Odd-Max-Bit have constant IC while QC/C_min is linear.
Complexity measures and decision tree complexity: a survey
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Instance complexity of Boolean functions
Instance complexity of symmetric Boolean functions is completely characterized with only Parity and complement at value 1; Greater-Than and Odd-Max-Bit have constant IC while QC/C_min is linear.