Pages that link to "Item:Q3525764"
From MaRDI portal
The following pages link to The Computational Complexity of the Parallel Knock-Out Problem (Q3525764):
Displaying 5 items.
- Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698) (← links)
- Eliminating graphs by means of parallel knock-out schemes (Q867852) (← links)
- Black-box Complexity of Parallel Search with Distributed Populations (Q2981878) (← links)
- On Linear Recognition of Tree-Width at Most Four (Q4875439) (← links)
- Анализ сложности алгоритма параллельного поиска “золотой” коллизии (Q5152407) (← links)