A theoretical basis for the reduction of polynomials to canonical forms
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
We define a certain type of bases of polynomial ideals whose usefulness stems from the fact that a number of computability problems in the theory of polynomial ideals (e.g. the problem of constructing canonical forms for polynomials) is reducible to the construction of bases of this type. We prove a characterization theorem for these bases which immediately leads to an effective method for their construction.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mathematical Theory of Computation
Manna, Z. (1972) · CERN Document Server (European Organization for Nuclear Research) · Cited by 697
Introduction to Mathematical Theory of Computation
Manna, Z. (1974) · Cited by 226
Cited by
Structural identifiability of systems biology models: a critical comparison of methods
Chis, O.-T., Banga, J. R., & Balsa-Canto, E. (2011) · PLoS ONE · doi:10.1371/journal.pone.0027755 · Cited by 448
Metadata
- Authors
- Buchberger, B.
- Venue
- ACM SIGSAM Bulletin
- Published
- 1976-08
- Volume
- 10
- Issue
- 3
- Pages
- 19-29
- ISSN
- 0163-5824 (ISSN-L)
- OpenAlex
- W2018615018
- Cited by
- 300
- References
- 2
- FWCI
- 1.61
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A theoretical basis for the reduction of polynomials to canonical forms. https://app.cochat.ai/papers/10.1145/1088216.1088219
- The paper
- Buchberger, B. (1976). A theoretical basis for the reduction of polynomials to canonical forms. ACM SIGSAM Bulletin. https://doi.org/10.1145/1088216.1088219
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.