Pages that link to "Item:Q1977753"
From MaRDI portal
The following pages link to The propositional formula checker HeerHugo (Q1977753):
Displaying 10 items.
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- Equivalent literal propagation in the DLL procedure (Q1408382) (← links)
- A satisfiability procedure for quantified Boolean formulae (Q1408385) (← links)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130) (← links)
- SatEx: A web-based framework for SAT experimentation (Q2741519) (← links)
- Towards an efficient library for SAT: A manifesto (Q2741533) (← links)
- The propositional formula checker HeerHugo (Q2749861) (← links)
- Efficient CNF Simplification Based on Binary Implication Graphs (Q3007684) (← links)
- Failed Literal Detection for QBF (Q3007688) (← links)
- Transforming equality logic to propositional logic (Q4916229) (← links)