SAT solving using XOR-OR-AND normal forms.
From MaRDI portal
Publication:6653668
DOI10.1007/S11786-024-00594-XMaRDI QIDQ6653668
Bernhard Andraschko, Julian Danner, Martin Kreuzer
Publication date: 17 December 2024
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Applications of graph theory (05C90) Cryptography (94A60) Logic in computer science (03B70) Solving polynomial systems; resultants (13P15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- XOR local search for Boolean Brent equations
- Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- On conversions from CNF to ANF
- Conflict-Driven XOR-Clause Learning
- Algebraic attacks using SAT-solvers
- A Hybrid Graph Representation for Recursive Backtracking Algorithms
- ElimLin Algorithm Revisited
- Revisiting Hyper Binary Resolution
- Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages
- A machine program for theorem-proving
- Depth-First Search and Linear Graph Algorithms
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- An efficient key recovery attack on SIDH
- CNF encodings of symmetric functions
- Effective auxiliary variables via structured reencoding
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)
