首页>
外文OA文献
>A Fast Algorithm for Computing the Maximum Number of Prime Implicants of Symmetric Boolean Functions (Studies on Computational Complexities and Related Topics)
【2h】
A Fast Algorithm for Computing the Maximum Number of Prime Implicants of Symmetric Boolean Functions (Studies on Computational Complexities and Related Topics)