Computing Sums of Radicals in Polynomial Time¶

Blomer, J. (1991). Computing Sums of Radicals in Polynomial Time. Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 670-677.

Type: Conference paper
Intellectual base: Primary research
Year: 1991
Pages: 670-677
DOI: 10.1109/sfcs.1991.185434
DOI registrant: Institute of Electrical and Electronics Engineers
Link: https://doi.org/10.1109/SFCS.1991.185434

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

Square-Root Sum Problem
- Equality testing for sums of radicals is a related but easier problem with polynomial-time algorithms; it does not by itself decide which side of zero a nonzero expression lies.

Verification¶

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:e0743cd2d9fd · see in the full table