Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method

Thore Husfeldt and Theis Rauhe
Proc. 25th Int. Coll. Automata, Languages, and Programming (ICALP 1998), Lecture Notes in Computer Science 1443, Kim Guldstrand Larsen, Sven Skyum, and Glynn Winskel, ed., Springer-Verlag, 1998, pp. 67–78
http://www.brics.dk/~theis/Publications/icalp98.pdf

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!