Aproximaciones lineales y polinomiales desarrolladas en fortran con la gráfica resultante mostrada en máxima.
-
Updated
Dec 22, 2017 - Fortran
#
aproximacion-polimonial
Here are 2 public repositories matching this topic...
Approximation algorithms are algorithms that find approximate solutions to optimization problems, usually with a guarantee of the solution's quality relative to the optimal solution. They are used when exact solutions are too time-consuming to compute. Approximation algorithms trade-off optimality for efficiency and are commonly used in scheduling.
kotlin java ui js algorithms cpp ux material-ui algorithm-challenges algorithms-datastructures algorithms-and-data-structures aproximated-circuits aproximation aproximacion-lineal aproximacion-polimonial
-
Updated
Feb 9, 2023 - Kotlin
Improve this page
Add a description, image, and links to the aproximacion-polimonial topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the aproximacion-polimonial topic, visit your repo's landing page and select "manage topics."