 In other words, an asymptotically optimal algorithm of linearithmic time complexity is known for this model.The algebraic computation tree model basically means that the allowable algorithms are only the ones that can perform polynomial operations of bounded degree on the input data and comparisons of the results of these computations.The same lower bound was later proved for the randomized algebraic decision tree model.