Quantifier elimination in automatic loop parallelization
From MaRDI portal
Publication:2457396
DOI10.1016/j.jsc.2005.09.012zbMath1124.68035OpenAlexW2080706210MaRDI QIDQ2457396
Christian Lengauer, Armin Größlinger, M. Griebl
Publication date: 23 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2005.09.012
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of compilers and interpreters (68N20) Parallel algorithms in computer science (68W10) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (2)
Quantifier elimination by cylindrical algebraic decomposition based on regular chains ⋮ Special algorithm for stability analysis of multistable biological regulatory systems
Uses Software
Cites Work
- Unnamed Item
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- The complexity of linear problems in fields
- Dataflow analysis of array and scalar references
- Some efficient solutions to the affine scheduling problem. II: Multidimensional time
- Mapping affine loop nests
- Applying Linear Quantifier Elimination
- New Finite Pivoting Rules for the Simplex Method
- Algorithm for discovering the set of all the solutions of a linear programming problem
This page was built for publication: Quantifier elimination in automatic loop parallelization