Applications of the complexity space to the General Probabilistic Divide and Conquer Algorithms

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 2008 English Publisher:Elsevier BVJournal:Journal of Mathematical Analysis and Applications, volume 348, pages 346-355 (issn: 0022-247X,

Copyright policy )Funded by:SFI | Expanding the scope and a...

Authors: García-Raffi, L.M.; Romaguera, S.; Schellekens, M.P.;

doi: 10.1016/j.jmaa.2008.07.026

Applications of the complexity space to the General Probabilistic Divide and Conquer Algorithms

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

National University of Ireland
Ireland
Universitat Politècnica de València
Spain

Keywords

recurrence, Improver, Analysis of algorithms and problem complexity, Applied Mathematics, probabilistic divide and conquer algorithm, Fixed point, Smyth complete, improver, complexity quasi-metric space, fixed point, Recurrence, Complexity quasi-metric space, Probabilistic Divide and Conquer Algorithm, Analysis of algorithms, Analysis

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	21
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%