Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences

Biing-Feng Wang

doi:10.1016/s0304-3975(98)00334-x

ScienceGate Book Chapters

JOURNAL ARTICLE

Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences

Biing-Feng Wang

Year: 2000 Journal: Theoretical Computer Science Vol: 242 (1-2)Pages: 377-401 Publisher: Elsevier BV

DOI: 10.1016/s0304-3975(98)00334-x

Get Full-Text PDF Get Analytical Report

Keywords:

Divide and conquer algorithms Combinatorics Minimax Mathematics Upper and lower bounds Partition (number theory) Function (biology) Discrete mathematics Algorithm Mathematical optimization Mathematical analysis

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.20

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences

Metrics

Citation History

Topics

Related Documents

Multidimensional Divide-and-Conquer Maximin Recurrences

Combinatorial solutions of multidimensional divide-and-conquer recurrences

Combinatorial solutions of multidimensional divide-and-conquer recurrences

The analysis of multidimensional divide-and-conquer recurrences

Solving Divide and Conquer Recurrences