Lower Bounds on the Multiparty Communication Complexity

By Duris P.   Rolim J.D.P.  

Journal of Computer and System Sciences, Vol. 56, Iss. 1, 1998-02 ,pp. : 90-95

Academic Press

Access to resources Recommend Favorite

Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory

By Hemaspaandra L.A.   Rothe J.  

Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. : 648-659

Academic Press

Access to resources Recommend Favorite

A comparison of two lower-bound methods for communication complexity

By Dietzfelbinger M.   Hromkovic J.   Schnitger G.  

Theoretical Computer Science, Vol. 168, Iss. 1, 1996-11 ,pp. : 39-51

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