原书出处
Introduction to Algorithms, Fourth Edition
D 附录D 矩阵
n, the usual rules of addition and multiplication apply. The exception is that 1 + 1 = 0.
You can think of arithmetic over GF(2) as being just like regular integer arithmetic, except that you use only the least-significant bit. As an example, for S2 = {0, 1, 2, 3}, the matrix
defines the following permutation πA: πA(0) = 0, πA(1) = 3, πA(2) = 2, πA(3) = 1. To see
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix004.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea