Zhiqiang Zhang, Yaoyun Shi. On the parity complexity measures of Boolean functions. Theoretical Computer Science, 411(26-28):2612-2618, 2010. [doi]
@article{ZhangS10-7,
title = {On the parity complexity measures of Boolean functions},
author = {Zhiqiang Zhang and Yaoyun Shi},
year = {2010},
doi = {10.1016/j.tcs.2010.03.027},
url = {http://dx.doi.org/10.1016/j.tcs.2010.03.027},
researchr = {https://researchr.org/publication/ZhangS10-7},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {411},
number = {26-28},
pages = {2612-2618},
}