Author:
Aoki Yasukazu,Imai Hiroshi,Imai Keiko,Rappaport David
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Aoki, Y., “The Combinatorial Complexity of Reconstructing Arrangements,” Doctoral Thesis, Department of Information Science, University of Tokyo, 1993.
2. Baur, W., and V. Strassen, “The Complexity of Partial Derivatives,” Theoretical Computer Science, Vol. 22 (1983), pp. 317–330.
3. Canny, J., “A New Algebraic Method for Robot Motion Planning and Real Geometry,” Proceedings of the 28th IEEE Annual Symposium on Foundations of Computer Science, 1987, pp.39–48.
4. Cole, R., and C. Yap, “Shape from Probing,” Journal of Algorithms, Vol. 8 (1987), pp. 19–38.
5. Dobkin, D., H. Edelsbrunner, and C. K. Yap, “Probing Convex Polytopes,” Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986, pp.424–432.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献