Author:
Denny-Brown Derek,Han Yenjo,Hemaspaandra Lane A.,Torenvliet Leen
Abstract
A semi-membership algorithm for a set
A
is, informally, a program that when given any two strings determines which is logically more likely to be in
A
.
A
flurry of interest in this topic in the late seventies and early eighties was followed by a relatively quiescent half-decade. However, in the 1990s there has been a resurgence of interest in this topic. We survey recent work on the theory of semi-membership algorithms.
Publisher
Association for Computing Machinery (ACM)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献