A Strong and Easily Computable Separation Bound for Arithmetic Expressions 
Involving Square Roots

Mehlhorn, Kurt; Burnikel, Christoph; Fleischer, Rudolf; Schirra, Stefan

Item

ITEM ACTIONSEXPORT

DownloadE-Mail

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1331488_2

DetailsSummary

A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots

Mehlhorn, K., Burnikel, C., Fleischer, R., & Schirra, S. (1997). A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97) (pp. 702-709). New York, USA: ACM / SIAM.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-38CB-1 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-38CC-0

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Mehlhorn, Kurt¹, Author
Burnikel, Christoph¹, Author
Fleischer, Rudolf¹, Author
Schirra, Stefan¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2005-08-02Date issued: 1997

Publication Status: Issued

Pages: -

Publishing info: New York, USA : ACM / SIAM

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 344414
Other: Local-ID: C1256428004B93B8-806612651572071EC12564840055AE96-Burnikel-et-al97

Degree: -

Event

show

hide

Title: Untitled Event

Place of Event: New Orleans, USA

Start-/End Date: 1997-01-05

Legal Case

show

Project information

show

Source 1

show

hide

Title: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97)

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: New York, USA : ACM / SIAM

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 702 - 709 Identifier: -