判定平方布尔函数的计数算法

AN ALGORITHM FOR DECIDING QUADRATIC BOOLEAN FUNCTIONS BY COUNTING

一个ｎ元函数是否为平方布尔函数？如果是，如何得到其所有的平方项？文中就此判定问题提出了一个时间复杂度为Ｏ（ｍｎ￣３）的计数算法．与经典的Ｑ－Ｍ算法不同，该算法基于直观的真值计数，并适合于并行实现．

An algoritTlm is proposed to decide whether a function of nvat.ial,les is a quadratic Boolean fullctioll.If sol how can wu o1J;oain the quadratieterms? Diesel-el.t frolil the Quine--McOluskey method, our algorithm is based on t.heeounting uf valued 0, i and allows a high 16vel of parallelism.