Average complexity of divide-and-conquer algorithms. Information processing letters vol. 29, no. 6 (8 December 1988) pp. 319-326
Document Type
Syllabus
Publication Date
10-3-1989
Identifier
45249131129 (Scopus)
Publication Title
Information Processing Letters
External Full Text Location
https://doi.org/10.1016/0020-0190(89)90028-8
ISSN
00200190
First Page
329
Issue
6
Volume
32
Recommended Citation
Veroy, Boris S., "Average complexity of divide-and-conquer algorithms. Information processing letters vol. 29, no. 6 (8 December 1988) pp. 319-326" (1989). Faculty Publications. 20733.
https://digitalcommons.njit.edu/fac_pubs/20733
COinS
