Toward an optimal quantum algorithm for polynomial factorization over finite fields | NobleID

Knowledge Graph Citation Graph Docs

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Toward an optimal quantum algorithm for polynomial factorization over finite fields

Identifier:nobleid.org/w1/20260515/DBB83FFD

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/DBB83FFD.svg?ark=w1%2F20260515%2FDBB83FFD)](https://nobleid.org/work/w1/20260515/DBB83FFD)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Claim authorship of this work

info@nobleid.org

About Terms Policy Persistence & Resolver Service Policy Pricing