Better path-finding algorithms in LPS Ramanujan graphs (Q1755951): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q62047234, #quickstatements; #temporary_batch_1707161894653 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Magma / rank | |||
Normal rank | |||
Revision as of 11:41, 28 February 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
