z-logo
open-access-imgOpen Access
Rational Divide-and-Conquer Relations
Author(s) -
Charinthip Hengkrawit,
Vichian Laohakosol,
Watcharapon Pimsert
Publication year - 2011
Publication title -
isrn mathematical analysis
Language(s) - English
Resource type - Journals
eISSN - 2090-4665
pISSN - 2090-4657
DOI - 10.5402/2011/908508
Subject(s) - algorithm , computer science
A rational divide-and-conquer relation, which is a natural generalization of the classical divide-and-conquer relation, is a recursive equation of the form ()=((),(),…,(−1))

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom