登入選單

返回Google圖書搜尋

Opportunistic Algorithms for Eliminating Supersets

Paul Pritchard

出版	University of Queensland, Department of Computer Science, 1990
URL	http://books.google.com.hk/books?id=HIFcHwAACAAJ&hl=&source=gbs_api

註釋

Abstract: "The main problem tackled in this paper is that of finding each set in a given collection that has no proper subset in the collection. Starting with a solution that uses a quadratic (in the size of the collection) number of subset tests, solutions are developed that are opportunistic in the sense of running significantly faster for certain classes of input (such as when most sets are small), but without running slower on other input. They are based on an opportunistic algorithm for the fundamental problem of finding an element common to two ordered sequences. Methodological issues are emphasized throughout. En passant, new notation is introduced for open, closed, and half-open intervals."