NP-Hardness in Geometric Construction Problems with One Interval Parameter
暂无分享,去创建一个
[1] Robert Joan Arinyo,et al. Basic geometric operations in ruler-and-compass constraint solvers using interval arithmetic , 1998 .
[2] Christos H. Papadimitriou,et al. Elements of the Theory of Computation , 1997, SIGA.
[3] Robert Joan-Arinyo,et al. A correct rule-based geometric constraint solver , 1997, Comput. Graph..
[4] Christoph M. Hoffmann,et al. A graph-constructive approach to solving systems of geometric constraints , 1997, TOGS.
[5] R. Joan-Arinyo,et al. A ruler-and-compass geometric constraint solver , 1997 .
[6] Vladik Kreinovich. Interval rational = algebraic , 1995, SGNM.
[7] Robert Joan Arinyo. Triangles, ruler, and compass , 1995 .
[8] J. C. Martin,et al. Introduction to Languages and the Theory of Computation" 3rd Ed , 1991 .
[9] D. J. H. Garling,et al. A Course in Galois Theory , 1987 .
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .