On the cell probe complexity of polynomial evaluation (Q673647): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A lower bound for finding predecessors in Yao's cell probe model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hash functions for priority queues / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4281568 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower bounds for union-split-find related problems on random access machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity models for incremental computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Should Tables Be Sorted? / rank | |||
Normal rank |
Latest revision as of 10:26, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the cell probe complexity of polynomial evaluation |
scientific article |
Statements
On the cell probe complexity of polynomial evaluation (English)
0 references
28 February 1997
0 references