Name
Title | ||
|---|---|---|
A strong and easily computable separation bound for arithmetic expressions involving square roots |
Abstract | ||
|---|---|---|
We consider arithmetic expressions over operators +, -, *, /, and root, with integer operands. For an expression E, a separation bound sep(E) is a positive real number with the property that E not equal 0 implies \E\ greater than or equal to sep(E). We propose a new separation bound that is easy to compute and stronger than previous bounds. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.5555/314161.314421 | SODA |
Keywords | Field | DocType |
computable separation,arithmetic expression,square root,randomized algorithms,approximation algorithms | Integer,Approximation algorithm,Randomized algorithm,Discrete mathematics,Combinatorics,Mathematical Operators,Arithmetic expressions,Operator (computer programming),Square root,Real number,Mathematics | Conference |
ISBN | Citations | PageRank |
0-89871-390-0 | 10 | 0.71 |
References | Authors | |
5 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Burnikel | 1 | 75 | 5.93 |
| R. Fleischer | 2 | 10 | 0.71 |
| K. Mehlhorn | 3 | 10 | 0.71 |
| S. Schirra | 4 | 87 | 7.91 |