Author:
Li Xiao-hua,Shen Ji-zhong
Funder
National Natural Science Foundation of China
National Social Science Foundation of China
Zhejiang Provincial Natural Science Foundation of China
National Key Technology Research and Development Program of the Ministry of Science and Technology of China
Publisher
Zhejiang University Press
Reference20 articles.
1. Acharya, J., Jafarpour, A., Orlitsky, A., 2011. Expected query complexity of symmetric Boolean functions. Proc. 49th Annual Allerton Conf. on Communication, Control, and Computing, p.26–29. [doi:10.1109/Allerton.2011.6120145]
2. Blais, E., Weinstein, A., Yoshida, Y., 2012. Partially symmetric functions are efficiently isomorphism-testable. Proc. IEEE 53rd Annual Symp. on Foundation of Computer Science, p.551–560. [doi:10.1109/FOCS.2012.53]
3. Cheng, J., Chen, X., Faraj, K.M., et al., 2003. Expansion of logical function in the OR-coincidence system and the transform between it and maxterm expansion. IEE Proc.-Comput. Dig. Tech., 150(6):397–402. [doi:10.1049/ip-cdt:20030969]
4. Falkowski, B., Kannurao, S., 1999. Identification of Boolean symmetries in spectral domain of Reed-Muller transform. Electron. Lett., 35(16):1315–1316. [doi:10.1049/el:19990955]
5. Heinrich-Litan, L., Molitor, P., 2000. Least upper bounds for the size of OBDDs using symmetry properties. IEEE Trans. Comput., 49(4):360–368. [doi:10.1109/12.844348]