Lower bounds for dynamic algebraic problems
From MaRDI portal
Publication:1854488
DOI10.1006/inco.2001.3046zbMath1005.68076OpenAlexW2064176976MaRDI QIDQ1854488
Johan P. Hansen, Gudmund Skovbjerg Frandsen, Peter Bro Miltersen
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.2001.3046
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Dynamic matrix rank ⋮ Dynamic normal forms and dynamic characteristic polynomial ⋮ A (slightly) faster algorithm for Klee's measure problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A geometric construction of a superconcentrator of depth 2
- On data structures and asymmetric communication complexity
- Surpassing the information theoretic bound with fusion trees
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Lower bounds for union-split-find related problems on random access machines
- On Dynamic Algorithms for Algebraic Problems
- On the Complexity of Maintaining Partial Sums
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Lower Bounds on the Complexity of Some Optimal Data Structures
- The Complexity of Maintaining an Array and Computing Its Partial Sums
- An Algorithm for the Computation of Linear Forms
- On pointers versus addresses
- Communication Complexity
- ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS
- On the number of multiplications necessary to compute certain functions
This page was built for publication: Lower bounds for dynamic algebraic problems
