← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

D 附录D 矩阵

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.801Z

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