Vorobjov N.

N. Vorobjov

Information about the author N. Vorobjov will soon be added to the site.
Found 1 papers in total
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
1997
We introduce a new method of proving lower bounds on the depth of algebraic d -degree...
Papers per page: