Related content

Efficient Solution of A, x ^(k) = b ^(k) Using A ⁻¹

By Ditkowski Adi   Fibich Gadi   Gavish Nir  

Journal of Scientific Computing, Vol. 32, Iss. 1, 2007-07 ,pp. : 29-44

Springer Publishing Company

Access to resources Recommend Favorite

On the Exact Complexity of Evaluating Quantified k -CNF

By Calabro Chris   Impagliazzo Russell   Paturi Ramamohan  

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 817-827

Springer Publishing Company

Access to resources Recommend Favorite

A finite capacity BMAP _K /G _K /1 queue with the generalized foreground-background processor-sharing discipline

By D’Apice C.   Manzo R.  

Automation and Remote Control, Vol. 67, Iss. 3, 2006-03 ,pp. : 428-434

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Mining top − k frequent patterns without minimum support threshold

By Salam Abdus  

Knowledge and Information Systems, Vol. 30, Iss. 1, 2012-01 ,pp. : 57-86

Springer Publishing Company

Access to resources Recommend Favorite

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem

By Xiao Mingyu   Cai Leizhen   Yao Andrew  

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 510-520

Springer Publishing Company

Access to resources Recommend Favorite