Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method (1998)
Cached
Download Links
- [www.cs.lth.se]
- [www.itu.dk]
- [www.cs.lth.se]
- DBLP
Other Repositories/Bibliography
by
Thore Husfeldt
,
Theis Rauhe
| Venue: | In Proc. 25th Int. Coll. Automata, Languages, and Programming, number 1443 in Lecture Notes in Computer Science |
| Citations: | 7 - 3 self |
BibTeX
@INPROCEEDINGS{Husfeldt98hardnessresults,
author = {Thore Husfeldt and Theis Rauhe},
title = {Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method},
booktitle = {In Proc. 25th Int. Coll. Automata, Languages, and Programming, number 1443 in Lecture Notes in Computer Science},
year = {1998},
pages = {67--78},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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...
