Complexity lower bounds for randomized computation trees over zero characteristic fields

DOI10.1007/S000370050002MaRDI QIDQ1587344zbMATH OpenOpenAlexFDO

Authors Dima 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)

Recommendations

• scientific article; zbMATH DE number 1775407
• Randomized complexity lower bound for arrangements and polyhedra
• Publication:4934316
• scientific article; zbMATH DE number 1559524
• A lower bound for randomized algebraic decision trees

Cited in

(6)

• Randomized complexity lower bound for arrangements and polyhedra
• A lower bound for randomized algebraic decision trees
• Complexity bounds for zero-test algorithms
• scientific article; zbMATH DE number 1559524 (Why is no real title available?)
• scientific article; zbMATH DE number 1775407 (Why is no real title available?)
• On topological lower bounds for algebraic computation trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587344)