Using fewer processors to reduce time complexities of semigroup computations

DOI10.1016/0020-0190(89)90036-7zbMath0681.68059OpenAlexW2071610585MaRDI QIDQ1823684

Yanyan Li

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/154648/1/03.pdf

zbMATH Keywords

complexityparallel processingcomputationalsemigroup computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Cites Work

• Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
• Mesh-Connected Computers with Broadcasting

This page was built for publication: Using fewer processors to reduce time complexities of semigroup computations