Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations (Q3936198): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:30, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations |
scientific article |
Statements
Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations (English)
0 references
1982
0 references
Boolean matrix
0 references
sorting
0 references
time-space tradeoff
0 references
pebbling
0 references
straight-line program
0 references
