PDF-Towards Polynomial Lower Bounds for Dynamic Problems Mihai P atrascu ATT Labs ABSTRACT We consider a number of dynamic problems with no known polylogarithmic upper bounds and show that they require

↓ Download
PDF-Towards Polynomial Lower Bounds for Dynamic Problems Mihai P atrascu ATT Labs ABSTRACT We consider a number of dynamic problems with no known polylogarithmic upper bounds and show that they require thumbnail
Our result is modular 1 We describe a carefullychosen dynamic version of set disjointness the multiphase problem and conjecture that it requires 84861 time per operation

Download Presentation

"Towards Polynomial Lower Bounds for Dynamic Problems Mihai P…" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.

Presentation Transcript

Transcript not available.

Related Topics