Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees - researchr publication references

researchr

You are not signed in
Sign in
Sign up

Dima Grigoriev, Marek Karpinski, Nicolai Vorobjov. Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees. In FOCS. pages 258-265, 1995.

No references recorded for this publication.

No citations of this publication recorded.

runs on WebDSL