4 Opinio n This is an excellent book! It is well written and can and should be used as the basis of undergraduat e as well as graduate courses in computational geometry . It can be studied by and will be usefu l for beginners and can be an excellent reference for the readers more familiar with the area . Th e improved second edition can draw a new army of researches in computational geometry . In the las t line of the book the author said : "Enjoy!" . I did . And I believe that so would its every reader . Review of Bounded Queries in Recursion Theory 3 William A . Gasarch and Georgia A . Martin Progress in Computer Science & Applied Logic, Volume 1 6 Birkhauser . Boston, Basel, Berlin, 1999, xiii -I- 353 pp . Hardcover, ISBN : 0817639667, $49 .5 0 : Lance Fortnow, University of Chicago, fortnow cs .uchicago .ed u Reviewer 1 Overview Consider a set A of strings . Suppose you have a list of a thousand strings . You want to know how many of these strings are in A . You are allowed to make queries
/lp/association-for-computing-machinery/book-review-of-bounded-queries-in-recursion-theory-by-william-a-RJ7Epwgygd