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.

Type: Conference paper
Intellectual base: Primary research
Year: 1991
DOI: 10.1109/sfcs.1991.185434
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¶

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:e0743cd2d9fd · see in the full table