An alternative proof for the equivalence of searcher and 2-searcher (Q284588)
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 6581639
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An alternative proof for the equivalence of searcher and 2-searcher |
scientific article; zbMATH DE number 6581639 |
Statements
An alternative proof for the equivalence of searcher and 2-searcher (English)
0 references
18 May 2016
0 references
polygon search
0 references
2-searcher
0 references
searcher
0 references
equivalence
0 references
0.7622847557067871
0 references
0.7560102343559265
0 references
0.7523983716964722
0 references
0.7474861145019531
0 references
