Pages that link to "Item:Q3224685"
From MaRDI portal
The following pages link to Formalization of Abstract State Transition Systems for SAT (Q3224685):
Displaying 7 items.
- Formalization and implementation of modern SAT solvers (Q839035) (← links)
- A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
- Verifying the conversion into CNF in dafny (Q2148786) (← links)
- Functional Encryption for Inner Product with Full Function Privacy (Q2798775) (← links)
- (Q4255568) (← links)
- A proof system for graph (non)-isomorphism verification (Q5883756) (← links)
- On enumerating short projected models (Q6657245) (← links)