A TIGHT BOUND FOR APPROXIMATING THE SQUARE ROOT

Simple item page
dc.contributor.authorBshouty, N.eng
dc.contributor.authorMansour, Y.eng
dc.contributor.authorTiwari, P.eng
dc.contributor.authorSchieber, B.eng
dc.date.accessioned2008-02-27T16:49:50Z
dc.date.available2008-02-27T16:49:50Z
dc.date.computerscience1999-05-27eng
dc.date.issued1995-05-01eng
dc.description.abstractWe prove an $OMEGA$(loglog(1/$epsilon$)) lower bound on the depth of any computation tree and any RAM program with operations {$+, -, *, /, left floor cdot right floor, not, and, or, xor$}, unlimited power of answering YES/NO questions, and constants {0,1} that computes $sqrt x$ to accuracy $epsilon$, for all $x \(mo $ [1,2]. Since Newton method achieves such an accuracy in $O$(loglog(1/$epsilon$)) depth, our bound is tight.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1995-570-22eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30474
dc.identifier.urihttp://hdl.handle.net/1880/45753
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleA TIGHT BOUND FOR APPROXIMATING THE SQUARE ROOTeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1995-570-22.pdf
Size:
514.05 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications