Set Membership Test Task: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "** ..." to "** …") |
m (Text replacement - ". ----" to ". ----") |
||
| Line 7: | Line 7: | ||
** [[Sequence Membership Test Task]]. | ** [[Sequence Membership Test Task]]. | ||
* <B>See:</B> [[Lookup Hash]], [[Bloom Filter]]. | * <B>See:</B> [[Lookup Hash]], [[Bloom Filter]]. | ||
---- | ---- | ||
---- | ---- | ||
Latest revision as of 20:55, 23 September 2021
A Set Membership Test Task is an existence test task (that applies a set membership relation.
- Context:
- It can range from being a Deterministic Set Membership Test Task to being a Probabilistic Set Membership Test Task.
- It can be solved by a Set Membership Existence Test System (that implements a Set Membership Existence Test Algorithm.
- …
- Counter-Example(s):
- See: Lookup Hash, Bloom Filter.
References
2004
- http://www.perl.com/pub/2004/04/08/bloom_filters.html
- Anyone who has used Perl for any length of time is familiar with the lookup hash, a handy idiom for doing existence tests: