Verification of non-linear overconstraints in Euclidean geometry with linear programming
1995
This paper is about one representation of constructible numbers which allows use of solver of linear constraints. A implementation is given in PrologIII and experiments are discussed.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI