Deterministic Polynomial-Time Factorization over Finite Fields
Source: hexagonmath.org/abs/2611.00135v2
Using prime-field factorization and a Dedekind zeta zero-free theorem, we obtain deterministic polynomial-time algorithms for complete factorization over finite fields and for constructing their presentations from their orders.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00135
curl -X POST /api/v1/records/hexagon/2611.00135/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00135/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'