Multiple-Size Divide-and-Conquer Recurrences

01/15/2001
by   Ming-Yang Kao, et al.
0

This short note reports a master theorem on tight asymptotic solutions to divide-and-conquer recurrences with more than one recursive term: for example, T(n) = 1/4 T(n/16) + 1/3 T(3n/5) + 4 T(n/100) + 10 T(n/300) + n^2.

READ FULL TEXT

page 1

page 2

page 3

research
11/24/2021

Explicit solution of divide-and-conquer dividing by a half recurrences with polynomial independent term

Divide-and-conquer dividing by a half recurrences, of the form x_n =a· x...
research
03/06/2021

Synthesis with Asymptotic Resource Bounds

We present a method for synthesizing recursive functions that satisfy bo...
research
10/17/2022

A Note on Quantum Divide and Conquer for Minimal String Rotation

Lexicographically minimal string rotation is a fundamental problem on st...
research
09/04/2018

A note on the tight example in On the randomised query complexity of composition

We make two observations regarding a recent tight example for a composit...
research
02/15/2020

A divide-and-conquer algorithm for computing Gröbner bases of syzygies in finite dimension

Let f_1,…,f_m be elements in a quotient R^n / N which has finite dimensi...
research
01/28/2022

Solving a percolation inverse problem with a divide-and-concur algorithm

We present a percolation inverse problem for diode networks: Given infor...
research
01/18/2022

Improve Sentence Alignment by Divide-and-conquer

In this paper, we introduce a divide-and-conquer algorithm to improve se...

Please sign up or login with your details

Forgot password? Click here to reset