Better path-finding algorithms in LPS Ramanujan graphs (Q1755951): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1515/jmc-2017-0051 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1515/JMC-2017-0051 / rank | |||
Normal rank | |||
Latest revision as of 08:32, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Better path-finding algorithms in LPS Ramanujan graphs |
scientific article |
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
