A counting algorithm for a cyclic binary query (Q1176288)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 13984
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A counting algorithm for a cyclic binary query |
scientific article; zbMATH DE number 13984 |
Statements
A counting algorithm for a cyclic binary query (English)
0 references
25 June 1992
0 references
datalog program
0 references
same generation
0 references
cyclic data
0 references
intersections of semilinear sets
0 references
0 references
0.8458661
0 references
0.84489197
0 references
0 references
0.84037703
0 references
0.83803344
0 references
0.83741796
0 references
0.83635676
0 references
0.83361155
0 references
