XOR local search for Boolean Brent equations

DOI10.1007/978-3-030-80223-3_29OpenAlexW3185975600MaRDI QIDQ2118332

Armin Biere, Marijn J. H. Heule, Wojciech Nawrocki, Andreas Fröhlich, Zhenjun Liu

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Uses Software

• MiniSat
• Walksat
• Plingeling
• CCASat
• Treengeling
• Lingeling
• YalSAT
• CaDiCaL
• CCAnr
• NLocalSAT
• FourierSAT
• CrystalBall

Cites Work

• Unnamed Item
• Local search for Boolean satisfiability with configuration checking and subscore
• Incremental inprocessing in SAT solving
• Local search for fast matrix multiplication
• CrystalBall: gazing in the black box of SAT solving
• Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
• New ways to multiply \(3 \times 3\)-matrices
• Generalising unit-refutation completeness and SLUR via nested input resolution
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break
• Algebraic Cryptanalysis of the Round-Reduced and Side Channel Analysis of the Full PRINTCipher-48
• Inprocessing Rules
• Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses
• CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability
• Neighbourhood Clause Weight Redistribution in Local Search for SAT
• Improving Stochastic Local Search for SAT with a New Probability Distribution
• Reconstructing Solutions after Blocked Clause Elimination
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing