Hardness Results for Dynamic Problems by Extensions of Fredman and Saks’ Chronogram Method

Forfattere

  • Thore Husfeldt
  • Theis Rauhe

DOI:

https://doi.org/10.7146/brics.v4i32.18958

Resumé

We introduce new models for dynamic computation based on the cell probe model of Fredman and Yao. We give these models access to nondeterministic queries or the right answer +-1 as an oracle. We prove that for the dynamic partial sum problem, these new powers do not help, the problem retains its lower bound of  Omega(log n/log log n).
From these results we easily derive a large number of lower bounds of order Omega(log n/log log n) for conventional dynamic models like the random access machine. We prove lower bounds for dynamic algorithms for reachability in directed graphs, planarity testing, planar point location, incremental parsing, fundamental data structure problems like maintaining the majority of the prefixes of a string of bits and range queries. We characterise the complexity of maintaining the value of any symmetric function on the prefixes of a bit string.

Downloads

Publiceret

1997-06-02

Citation/Eksport

Husfeldt, T., & Rauhe, T. (1997). Hardness Results for Dynamic Problems by Extensions of Fredman and Saks’ Chronogram Method. BRICS Report Series, 4(32). https://doi.org/10.7146/brics.v4i32.18958

Nummer

Nr. 32 (1997): RS-32 Hardness Results for Dynamic Problems by Extensions of Fredman and Saks’ Chronogram Method

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).