Lower time bounds for solving linear diophantine equations on several parallel computational models

DOI10.1016/S0019-9958(85)80035-8zbMath0588.68025OpenAlexW1966729834MaRDI QIDQ3716301

Friedhelm Meyer auf der Heide

Publication date: 1985

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(85)80035-8

zbMATH Keywords

parallel computationknapsack problemPRAMparallel random access machinescomputation treesDRAMdistributed systems of random access machinessolvability of linear Diophantine equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear Diophantine equations (11D04)

This page was built for publication: Lower time bounds for solving linear diophantine equations on several parallel computational models