Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the parallel computation for the knapsack problem
On the parallel computation for the knapsack problem
Hi-index | 0.01 |