Learning Shuffle Ideals with Membership Queries and Contrastive Examples
Paper shows many shuffle ideals are not efficiently learnable from membership or contrastive queries.
2 stories, newest first · one card per story
Paper shows many shuffle ideals are not efficiently learnable from membership or contrastive queries.
Cryptographers use Latin-square autoparatopisms to design critical sets that improve secret sharing.
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views