Randomized complexity lower bound for arrangements and polyhedra

DOI10.1007/PL00009425zbMath0936.68047MaRDI QIDQ1289238

Dima Yu. Grigoriev

Publication date: 18 May 2000

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

complexity lower bound

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

On the decisional complexity of problems over the reals

This page was built for publication: Randomized complexity lower bound for arrangements and polyhedra