# Complexity lower bounds for randomized computation trees over zero characteristic fields

#### Abstract

We obtain nonlinear complexity lower bounds for randomized computation trees with branching signs $\{=,\not=\}$ over zero charac-teristic fields. As consequences we get the $\Omega(n\,{\rm log}\,n)$ lower bound for the distinctness problem and $\Omega (n^2)$ lower bound for the knapsack problem. For more customary randomized computation trees over the… (More)
DOI: 10.1007/s000370050002

#### Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.