Polynomial algorithms for computing the permanents of some matrices

Let $B_n$ be the matrix whose columns are all $n$-dimensional non-zero Boolean vectors and let $B_{nk}$ be the matrix whose columns are all $n$-dimensional Boolean vectors with $k$ unities. We suggest polynomial with respect to $n$ algorithms to compute the permanents of these matrices and some related matrices. These algorithms are based on the generating functions for values of permanents of the matrices under consideration.