Gadgil, S and Tadipatri, A (2022) Euclidean Geometry by High-performance Solvers? In: Resonance, 27 (5). pp. 801-816.
![]() |
PDF
res_27-5_801-816_2022.pdf - Published Version Restricted to Registered users only Download (4MB) | Request a copy |
Official URL: https://doi.org/10.1007/s12045-022-1373-7
Abstract
Tarski showed in the 1950s that (first-order) questions in Euclidean geometry could be answered algorithmically. Algorithms for doing this have greatly improved over the decades but still have high complexity (in terms of time taken). We experiment using state-of-the-art software, specifically so-called SMT Solvers, to see how practical it is to prove classical Euclidean geometry results in this way.
Item Type: | Journal Article |
---|---|
Publication: | Resonance |
Publisher: | Springer |
Additional Information: | The copyright for this article belongs to the Springer. |
Department/Centre: | Division of Physical & Mathematical Sciences > Mathematics |
Date Deposited: | 24 Jun 2022 10:42 |
Last Modified: | 24 Jun 2022 10:42 |
URI: | https://eprints.iisc.ac.in/id/eprint/73644 |
Actions (login required)
![]() |
View Item |