Pages that link to "Item:Q911295"
From MaRDI portal
The following pages link to An optimal algorithm for generating equivalence relations on a linear array of processors (Q911295):
Displaying 6 items.
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Listing combinatorial objects in parallel (Q3378053) (← links)
- A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS (Q3520739) (← links)
- On random and adaptive parallel generation of combinatorial objects (Q3989785) (← links)
- An approach to checking link conflicts in the mapping of uniform dependence algorithms into lower dimensional processor arrays (Q4571406) (← links)
- A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL (Q4820168) (← links)