Better path-finding algorithms in LPS Ramanujan graphs (Q1755951)
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 7000402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Better path-finding algorithms in LPS Ramanujan graphs |
scientific article; zbMATH DE number 7000402 |
Statements
Better path-finding algorithms in LPS Ramanujan graphs (English)
0 references
11 January 2019
0 references
cryptography
0 references
Cayley graph
0 references
Tillich-Zémor hash function
0 references
path finding algorithm
0 references
0.7981324791908264
0 references
0.7789207696914673
0 references
0.7508324384689331
0 references
0.7338163256645203
0 references
