Pages that link to "Item:Q4229814"
From MaRDI portal
The following pages link to Paradigms for Fast Parallel Approximability (Q4229814):
Displaying 13 items.
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204) (← links)
- A variable precision approach to speedup iterative schemes on fine grained parallel machines (Q1195706) (← links)
- Nearly logarithmic-time parallel algorithms for the class of \(\pm 2^ b\) ASCEND computations on a SIMD hypercube (Q1325982) (← links)
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
- Fast approximate PCPs (Q2819532) (← links)
- (Q3028097) (← links)
- (Q3369018) (← links)
- A Fast Parallel Horner Algorithm (Q3474278) (← links)
- A taxonomy of problems with fast parallel algorithms (Q3694688) (← links)
- (Q3995009) (← links)
- (Q4246513) (← links)
- On the parallel approximability of a subclass of quadratic programming. (Q5941277) (← links)