Efficient algorithms for some special cases of the polynomial equivalence problem | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Efficient algorithms for some special cases of the polynomial equivalence problem

Identifier:nobleid.org/w1/20260515/3C2CEAA8

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

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

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 FAQ Terms Policy Persistence & Resolver Service Policy