PROCESSOR LOWER BOUND FORMULAS FOR ARRAY COMPUTATIONS AND PARAMETRIC DIOPHANTINE SYSTEMS
From MaRDI portal
Publication:5248983
DOI10.1142/S0129054198000295zbMath1319.68243MaRDI QIDQ5248983
Peter R. Cappello, Ömer Eğecioğlu
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Counting solutions of Diophantine equations (11D45) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Linear Diophantine equations (11D04)
Related Items
Uses Software
Cites Work
- Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem
- On vector partition functions
- Linear homogeneous Diophantine equations and magic labelings of graphs
- Computationally Related Problems
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- The Organization of Computations for Uniform Recurrence Equations