Strong and easily computable separation bound for arithmetic expressions involving square roots

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1997, Pages 702-709

  Burnikel, C ^a   Fleischer, R ^a   Mehlhorn, K ^a   Schirra, S ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER PROGRAMMING; MATHEMATICAL OPERATORS; POLYNOMIALS; THEOREM PROVING;

SEPARATION BOUNDS; SQUARE ROOTS;

DIGITAL ARITHMETIC;

EID: 0030816964     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)