Output-sensitive Sparse Polynomial GCD over Finite Fields is NP-hard
[Submitted on 10 Jun 2026]
·
2026-06-11
·
via cs updates on arXiv.org
arXiv:2606.12144v1 Announce Type: new Abstract: In this paper, we prove that output-sensitive sparse polynomi…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。