Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems

By Sen S.  

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 59-78

Elsevier

Access to resources Recommend Favorite

On some decision problems for trace codings

By Bruyere V.   De Felice C.   Guaiana G.  

Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. : 227-260

Elsevier

Access to resources Recommend Favorite

The three-dimensional assignment and partition problems. New lower bounds

By Sergeev S.  

Automation and Remote Control, Vol. 67, Iss. 2, 2006-02 ,pp. : 242-250

MAIK Nauka/Interperiodica

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

Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures

By Attiya H.   Djerassi-Shintel T.  

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 8, 2001-08 ,pp. : 1096-1109

Academic Press

Access to resources Recommend Favorite