Robust algorithms for constructing strongly convex hulls in parallel

By Chen W.   Wada K.   Kawaguchi K.  

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 277-295

Elsevier

Access to resources Recommend Favorite

Lower bounds for some decision problems over C

By Malajovich  

Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. : 425-434

Elsevier

Access to resources Recommend Favorite

Complexity lower bounds for computation trees with elementary transcendental function gates

By Grigoriev D.   Vorobjov N.  

Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. : 185-214

Elsevier

Access to resources Recommend Favorite

Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems

By Bompadre Agustín  

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 659-700

Springer Publishing Company

Access to resources Recommend Favorite

On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method

By Kolpakov R.   Posypkin M.   Sigal I.  

Automation and Remote Control, Vol. 71, Iss. 10, 2010-10 ,pp. : 2152-2161

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite