Complexity lower bounds for randomized computation trees over zero characteristic fields

DOI10.1007/S000370050002zbMATH Open0961.68060OpenAlexW2040850762MaRDI QIDQ1587344FDOQ1587344

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

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

zbMATH Keywords

nonlinear complexity lower boundsrandomized computation trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (4)

• Title not available (Why is that?)
• Complexity bounds for zero-test algorithms
• On topological lower bounds for algebraic computation trees
• Title not available (Why is that?)

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)