PDF-Towards Polynomial Lower Bounds for Dynamic Problems Mihai P atrascu ATT Labs ABSTRACT PDF document

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

Upload by sherrill-nordquist
Published on 2014-12-14

Presentation Embed Code

<iframe width="560" height="315" src="https://www.docslides.com/embed/24025" frameborder="0" allowfullscreen></iframe>

Download Presentation

Download Presentation The PPT/PDF document "Towards Polynomial Lower Bounds for Dyna..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.