The DOI matches its Crossref record.
A new bound for Pólya's Theorem with applications to polynomials positive on polyhedra
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
Parrilo, P. A. (2000) · doi:10.7907/2k6y-ch43 · Cited by 1,802
Semidefinite programming relaxations for semialgebraic problems
Parrilo, P. A. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0387-5 · Cited by 1,527
Sums of Squares, Moment Matrices and Optimization Over Polynomials
Laurent, M. (2009) · The IMA Volumes in Mathematics and its Applications · doi:10.1007/978-0-387-09686-5_7 · Cited by 648
Approximation of the Stability Number of a Graph via Copositive Programming
de Klerk, E., & Pasechnik, D. V. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623401383248 · Cited by 322
LMI Relaxations in Robust Control
Scherer, C. W. (2006) · European Journal of Control · doi:10.3166/ejc.12.3-29 · Cited by 312
Metadata
- Authors
- Powers, V., & Reznick, B.
- Venue
- Journal of Pure and Applied Algebra
- Publisher
- Elsevier BV
- Published
- 2001-10
- Volume
- 164
- Issue
- 1-2
- Pages
- 221-229
- ISSN
- 0022-4049 (ISSN-L)
- OpenAlex
- W2047577886
- Cited by
- 179
- References
- 0
- FWCI
- 6.70
- Type
- journal article
- Language
- en
- Open access
- bronze
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 new bound for Pólya's Theorem with applications to polynomials positive on polyhedra. https://app.cochat.ai/papers/10.1016/s0022-4049(00)00155-9
- The paper
- Powers, V., & Reznick, B. (2001). A new bound for Pólya's Theorem with applications to polynomials positive on polyhedra. Journal of Pure and Applied Algebra. https://doi.org/10.1016/s0022-4049(00)00155-9
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.