Lower bounds on algebraic random access machines (Q4645192)
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 6999446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds on algebraic random access machines |
scientific article; zbMATH DE number 6999446 |
Statements
Lower bounds on algebraic random access machines (English)
0 references
10 January 2019
0 references
knapsack problem
0 references
computation tree
0 references
memory address
0 references
random access machine
0 references
element distinctness
0 references
0.978814423084259
0 references
0.978814423084259
0 references
0.8351846933364868
0 references
0.7952515482902527
0 references
0.7934606671333313
0 references
