原书出处
Introduction to Algorithms, Fourth Edition
D 附录D 矩阵
e get the following permutation πA,c: πA,c(0) = 2, πA,c(1) = 1, πA,c(2) = 0, πA,c(3) = 3.
We call any permutation that maps x ∈ Sn to Ax + c, for some n × n 0-1 matrix A with full rank and some n-bit vector c, a linear permutation. d. Use a counting argument to show that
the number of linear permutations of Sn is much less than the number of permutations of S
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix004.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea