Pages that link to "Item:Q3088000"
From MaRDI portal
The following pages link to Point-Free, Set-Free Concrete Linear Algebra (Q3088000):
Displaying 6 items.
- Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (Q287269) (← links)
- Certifying standard and stratified Datalog inference engines in SSReflect (Q1687733) (← links)
- Using abstract stobjs in ACL2 to compute matrix normal forms (Q1687754) (← links)
- Formalizing the LLL basis reduction algorithm and the LLL factorization algorithm in Isabelle/HOL (Q2209537) (← links)
- A formalisation in HOL of the fundamental theorem of linear algebra and its application to the solution of the least squares problem (Q2362109) (← links)
- A formalization of convex polyhedra based on the simplex method (Q5915783) (← links)
