E4.B — The complexity of knapsack problems in wreath products
Why the open web links it
Analyzes the computational complexity of knapsack problems in wreath products from a theoretical computer science perspective.
Linked by 2 independent sites, 2 of them widely read in the 2026-10 crawl of the open web, including mpg.de, mpi-sws.org.