Complexity lower bounds for randomized computation trees over zero characteristic fields

DOI10.1007/S000370050002zbMath0961.68060OpenAlexW2040850762MaRDI QIDQ1587344

Dima Yu. Grigoriev

Publication date: 6 February 2001

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000370050002

zbMATH Keywords

nonlinear complexity lower boundsrandomized computation trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Complexity lower bounds for randomized computation trees over zero characteristic fields