Abstract
We give a fully polynomial-time approximation scheme (FPTAS) to count the number 1 4 of q-colorings for k-uniform hypergraphs with maximum degree Delt......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
