Rank-two connected layer families of height $2n-\log_2 n-2$ on $n=2^k$ symbols · Prove2Me

P

Initializing...

Rank-two connected layer families of height $2n-\log_2 n-2$ on $n=2^k$ symbols · Prove2Me