Programming Pearl: Computing Convex Hulls with a Linear Solver: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:5014:50, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,657 bytes +2,657‎ Created page with "Title: Programming Pearl: Computing Convex Hulls with a Linear Solver Abstract: This research article discusses a programming tactic that has been widely applied in the analysis of logic programs. The method enables the computation of convex hulls, which are required for polyhedral analysis, to be coded with linear constraint solving machinery that is available in many Prolog systems. The technique has been adopted in the analysis of many logic programs, and it presents..."
Retrieved from "https://simplesci.org/wiki/Programming_Pearl:_Computing_Convex_Hulls_with_a_Linear_Solver"