What is the lower bound on the complexity of fast Fourier transform algorithms? Can they be faster than Θ (N log N)?
Dynamic optimality conjecture for splay trees
K-server problem
Can X + Y sorting be done in strictly less than O(n2 log n) time?
Is there a bounded-time algorithm for Envy-free cake-cutting?

We are always aiming to provide top quality academic writing services that will surely enable you achieve your desired academic grades. Our support is round the clock!

Type of paper Academic level Subject area
Number of pages Paper urgency Cost per page: