Pages that link to "Item:Q2564821"
From MaRDI portal
The following pages link to Strategy-accurate parallel Buchberger algorithms (Q2564821):
Displaying 15 items.
- Extended parallelism in the Gröbner basis algorithm (Q685087) (← links)
- A MIMD implementation of the Buchberger algorithm for Boolean polynomials (Q757067) (← links)
- Efficiency estimate for distributed computation of Gröbner bases and involutive bases (Q840029) (← links)
- A parallel implementation of Buchberger's algorithm over \(\mathbb{Z}_p\) for \(p\leq 31991\) (Q1264428) (← links)
- A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781) (← links)
- Parallel computation of Gröbner bases on distributed memory machines (Q1346478) (← links)
- Parallel dynamic semantics of sequential programs with speculative and incremental computation (Q1364092) (← links)
- Random allocation of jobs with weights and precedence (Q1365938) (← links)
- Parallelization of the Buchberger algorithm (Q1907790) (← links)
- Parallelization of modular algorithms (Q2430024) (← links)
- Parallelization of matrix algorithms for Gröbner basis computation (Q2452558) (← links)
- Parallel algorithms for Gröbner-basis construction (Q2462061) (← links)
- Parallel computation of Janet and Gröbner bases over rational numbers (Q2508522) (← links)
- Parallelization of triangular decompositions: techniques and implementation (Q2674015) (← links)
- On the correctness of a distributed memory Gröbner basis algorithm (Q5055786) (← links)