SAT solving using XOR-OR-AND normal forms.
From MaRDI portal
Cites work
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- A hybrid graph representation for recursive backtracking algorithms
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A machine program for theorem-proving
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
- Algebraic attacks using SAT-solvers
- Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
- An efficient key recovery attack on SIDH
- Applications of SAT solvers in cryptanalysis: finding weak keys and preimages
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- Boolean Gröbner bases. Theory, algorithms and applications
- CNF encodings of symmetric functions
- Conflict-driven XOR-clause learning
- Depth-First Search and Linear Graph Algorithms
- Effective auxiliary variables via structured reencoding
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- ElimLin algorithm revisited
- scientific article; zbMATH DE number 1515218 (Why is no real title available?)
- On conversions from CNF to ANF
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- Revisiting hyper binary resolution
- XOR local search for Boolean Brent equations
This page was built for publication: SAT solving using XOR-OR-AND normal forms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653668)
