A new method to obtain lower bounds for polynomial evaluation

Author： Aldaz

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.259, Iss.1, 2001-05, pp. : 577-596

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

New lower bounds on the cost of binary search trees

By De Prisco R. De Santis A.

Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. : 315-325

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

Treewidth Lower Bounds with Brambles

By Bodlaender Hans Grigoriev Alexander Koster Arie

Algorithmica, Vol. 51, Iss. 1, 2008-05 ,pp. : 81-98

Springer Publishing Company

Access to resources Recommend Favorite

Lower bounds for asynchronous consensus

By Lamport Leslie

Distributed Computing, Vol. 19, Iss. 2, 2006-10 ,pp. : 104-125

Springer Publishing Company

Access to resources Recommend Favorite

UPPER AND LOWER BOUNDS TO THE CHARACTERISTIC IMPEDANCE OF TRANSMISSION LINES USING THE FINITE-ELEMENT METHOD

By DALY P.

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 3, Iss. 2, 1993-12 ,pp. : 65-78

Emerald Group Publishing Ltd

Access to resources Recommend Favorite