Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations (Q3936198): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0211010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064136209 / rank | |||
Normal rank | |||
Latest revision as of 01:53, 20 March 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
