XOR local search for Boolean Brent equations
From MaRDI portal
Publication:2118332
Cites work
- Algebraic cryptanalysis of the round-reduced and side channel analysis of the full PRINTCipher-48
- CCAnr: a configuration checking based local search solver for non-random satisfiability
- Choosing probability distributions for stochastic local search and the role of make versus break
- CrystalBall: gazing in the black box of SAT solving
- Generalising unit-refutation completeness and SLUR via nested input resolution
- scientific article; zbMATH DE number 956863 (Why is no real title available?)
- Improving implementation of SLS solvers for SAT and new heuristics for k-SAT with long clauses
- Improving stochastic local search for SAT with a new probability distribution
- Incremental inprocessing in SAT solving
- Inprocessing rules
- Local search for Boolean satisfiability with configuration checking and subscore
- Local search for fast matrix multiplication
- Neighbourhood Clause Weight Redistribution in Local Search for SAT
- New ways to multiply \(3 \times 3\)-matrices
- Reconstructing solutions after blocked clause elimination
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
Cited in
(3)
Describes a project that uses
Uses Software
This page was built for publication: XOR local search for Boolean Brent equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118332)