The following pages link to Filip Marić (Q606998):
Displaying 20 items.
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL (Q606999) (← links)
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (Q670696) (← links)
- Formalization and implementation of modern SAT solvers (Q839035) (← links)
- Formalization of the Poincaré disc model of hyperbolic geometry (Q2031408) (← links)
- Faradžev Read-type enumeration of non-isomorphic CC systems (Q2230397) (← links)
- meSAT: multiple encodings of CSP to SAT (Q2342599) (← links)
- Formalizing complex plane geometry (Q2354913) (← links)
- Formalizing Frankl’s Conjecture: FC-Families (Q2907327) (← links)
- Formalization of Abstract State Transition Systems for SAT (Q3224685) (← links)
- Proving Correctness of a KRK Chess Endgame Strategy by Using Isabelle/HOL and Z3 (Q3454099) (← links)
- (Q3562927) (← links)
- Using simplex method in verifying software safety (Q3655035) (← links)
- Formalization of Incremental Simplex Algorithm by Stepwise Refinement (Q4647860) (← links)
- Verifying Faradžev-Read Type Isomorph-Free Exhaustive Generation (Q5049007) (← links)
- Automated Reasoning (Q5307059) (← links)
- (Q5376649) (← links)
- URBiVA: Uniform Reduction to Bit-Vector Arithmetic (Q5747772) (← links)
- A proof system for graph (non)-isomorphism verification (Q5883756) (← links)
- Automated triangle constructions in hyperbolic geometry (Q6185790) (← links)
- On automating triangle constructions in absolute and hyperbolic geometry (Q6653955) (← links)
