PDF-Towards Polynomial Lower Bounds for Dynamic Problems Mihai P atrascu ATT Labs ABSTRACT
Author : sherrill-nordquist | Published Date : 2014-12-14
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
Presentation Embed Code
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 website 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.
Towards Polynomial Lower Bounds for Dynamic Problems Mihai P atrascu ATT Labs ABSTRACT: Transcript
Download Document
Here is the link to download the presentation.
"Towards Polynomial Lower Bounds for Dynamic Problems Mihai P atrascu ATT Labs ABSTRACT"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.
Related Documents
