Emphasis on the flipping variable: Towards effective local search for hard random satisfiability
- 1 August 2021
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 566, 118-139
Abstract
No abstract availableKeywords
Funding Information
- Sichuan Provincial Science and Technology Support Program (2020YJ0270)
- National Natural Science Foundation of China (61673320)
- Ministry of Education of the People's Republic of China (20XJCZH016)
- Fundamental Research Funds for the Central Universities (2682019ZT16, 2682020CX59)
This publication has 11 references indexed in Scilit:
- Fault detection and therapeutic intervention in gene regulatory networks using SAT solversBioSystems, 2019
- Towards faster local search for minimum weight vertex cover on massive graphsInformation Sciences, 2019
- A comprehensive study and analysis on SAT-solvers: advances, usages and achievementsArtificial Intelligence Review, 2018
- Ant Colony Optimization With Local Search for Dynamic Traveling Salesman ProblemsIEEE Transactions on Cybernetics, 2016
- Scoring Functions Based on Second Level Score for k-SAT with Long ClausesJournal of Artificial Intelligence Research, 2014
- Clause States Based Configuration Checking in Local Search for SatisfiabilityIEEE Transactions on Cybernetics, 2014
- Local search for Boolean Satisfiability with configuration checking and subscoreArtificial Intelligence, 2013
- Automated Verification of Completeness and Consistency of Abstract State Machine Specifications using a SAT SolverElectronic Notes in Theoretical Computer Science, 2007
- Hiding Solutions in Random Satisfiability Problems: A Statistical Mechanics ApproachPhysical Review Letters, 2002
- Critical Behavior in the Satisfiability of Random Boolean ExpressionsScience, 1994