OMEGA(log log(1/epsilon)) LOWER BOUND FOR APPROXIMATING THE SQUARE ROOT
| dc.contributor.author | Bshouty, Nader H. | eng |
| dc.date.accessioned | 2008-05-26T20:40:26Z | |
| dc.date.available | 2008-05-26T20:40:26Z | |
| dc.date.computerscience | 1999-05-27 | eng |
| dc.date.issued | 1989-10-01 | eng |
| dc.description.abstract | In [FOCS 89], Mansour-Schieber-Tiwari proved that any computation tree with the operations {+, -, times, /, \(lf \(rf, <} and constants {0,1} that computes sqrt x to accuracy epsilon, for all x \(mo [1,2], must have depth OMEGA ( sqrt {log log(1/ epsilon )}). In this paper we prove that any computation tree with operations {+, -, times, /, \(lf \(rf, <, NOT, AND, OR, XOR}, indirect addressing, unlimited power of answering YES/NO questions and constants {0,1} that computes sqrt x to accuracy epsilon for all x \(mo [1,2] must have depth OMEGA(log log(1/epsilon)). By Newton iteration our bound is tight. | eng |
| dc.description.notes | We 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.ca | eng |
| dc.identifier.department | 1989-367-29 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30481 | |
| dc.identifier.uri | http://hdl.handle.net/1880/46599 | |
| dc.language.iso | Eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Computer Science | eng |
| dc.title | OMEGA(log log(1/epsilon)) LOWER BOUND FOR APPROXIMATING THE SQUARE ROOT | eng |
| dc.type | unknown | |
| thesis.degree.discipline | Computer Science | eng |