Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching

Forfattere

  • Thore Husfeldt
  • Theis Rauhe
  • Søren Skyum

DOI:

https://doi.org/10.7146/brics.v3i9.19972

Resumé

We give a number of new lower bounds in the cell probe model
with logarithmic cell size, which entails the same bounds on the random access computer with logarithmic word size and unit cost operations. We study the signed prefix sum problem: given a string of length n of zeroes and signed ones, compute the sum of its ith prefix during updates. We show a
lower bound of  Omega(log n/log log n) time per operations, even if the prefix sums are bounded by log n/log log n during all updates. We also show that if the update time is bounded by the product of the worst-case update time and the
answer to the query, then the update time must be Omega(sqrt(log n/ log log n)).
These results allow us to prove lower bounds for a variety of seemingly unrelated
dynamic problems. We give a lower bound for the dynamic planar point location in monotone subdivisions of
Omega(log n/ log log n) per operation. We give
a lower bound for the dynamic transitive closure problem on upward planar graphs with one source and one sink of
Omega(log n/(log logn)^2) per operation. We give a lower bound of  Omega(sqrt(log n/log log n)) for the dynamic membership problem of any Dyck language with two or more letters. This implies the same
lower bound for the dynamic word problem for the free group with k generators. We also give lower bounds for the dynamic prefix majority and prefix equality problems.

Downloads

Publiceret

1996-01-09

Citation/Eksport

Husfeldt, T., Rauhe, T., & Skyum, S. (1996). Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. BRICS Report Series, 3(9). https://doi.org/10.7146/brics.v3i9.19972

Nummer

Nr. 9 (1996): RS-9 Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).