Conventional bit-based division property trail search is NP-complete
Aleksei Udovenko, University of Luxembourg
·
2026-06-03
·
via Cryptology ePrint Archive
This short note shows that the conventional (2-subset) bit-based division property trail search problem is NP…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。