A logarithmic time complexity algorithm for pattern searching using product-sum property

DOI10.1016/j.camwa.2011.07.001zbMath1231.68115OpenAlexW2144715789MaRDI QIDQ660854

Khalid Mahmood Aamir, Stojan Radenović, Mujahid Abbas

Publication date: 5 February 2012

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.07.001

zbMATH Keywords

database searchlogarithmic complexity algorithmproduct-sum property

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (1)

A strong convergence theorem for fixed points of generalized asymptotically quasi-\(\phi\)-nonexpansive mappings

Cites Work

• EDM: A general framework for Data Mining based on Evidence Theory
• Tree structure for efficient data mining using rough sets
• Unnamed Item
• Unnamed Item

This page was built for publication: A logarithmic time complexity algorithm for pattern searching using product-sum property