Lower Bounds for Dynamic Algebraic Problems

Author： Frandsen G.S.   Hansen J.P.   Miltersen P.B.  

Publisher： Academic Press

ISSN： 0890-5401

Source： Information and Computation, Vol.171, Iss.2, 2001-12, pp. : 333-349

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Lower bounds for algebraic complexity of nilpotent associative algebras

By Leont’ev A.  

Journal of Mathematical Sciences, Vol. 169, Iss. 5, 2010-09 ,pp. : 644-650

Springer Publishing Company

Access to resources Recommend Favorite

Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems

By Kullmann Oliver  

Annals of Mathematics and Artificial Intelligence, Vol. 40, Iss. 3-4, 2004-03 ,pp. : 303-352

Springer Publishing Company

Access to resources Recommend Favorite

A computational analysis of lower bounds for big bucket production planning problems

By Akartunalı Kerem  

Computational Optimization and Applications, Vol. 53, Iss. 3, 2012-12 ,pp. : 729-753

Springer Publishing Company

Access to resources Recommend Favorite

Inductive Time-Space Lower Bounds for Sat and Related Problems

By Williams Ryan  

computational complexity, Vol. 15, Iss. 4, 2006-12 ,pp. : 433-470

Springer Publishing Company

Access to resources Recommend Favorite

Lower Bounds for Merging Networks

By Iwata S.  

Information and Computation, Vol. 168, Iss. 2, 2001-08 ,pp. : 187-195

Academic Press

Access to resources Recommend Favorite