Strongly maximal intersection-complete neural codes on grids are convex (Q2335598)
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 7130428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strongly maximal intersection-complete neural codes on grids are convex |
scientific article; zbMATH DE number 7130428 |
Statements
Strongly maximal intersection-complete neural codes on grids are convex (English)
0 references
14 November 2019
0 references
neural code
0 references
convex code
0 references
intersection-complete
0 references
grid
0 references
0 references
0.8585783839225769
0 references
0.845160186290741
0 references
0.8404088020324707
0 references
0.8384194374084473
0 references
0.814681887626648
0 references
