How much precision is needed to compare two sums of square roots of integers? (Q845866): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710339121855 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2006.05.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012326410 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A strong and easily computable separation bound for arithmetic expressions involving radicals / rank | |||
Normal rank | |||
Latest revision as of 09:57, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How much precision is needed to compare two sums of square roots of integers? |
scientific article |
Statements
How much precision is needed to compare two sums of square roots of integers? (English)
0 references
29 January 2010
0 references
computational geometry
0 references
numerical computations
0 references
square root of integer
0 references
