On the public citation graph
Scoring Functions Based on Second Level Score for k-SAT with Long Clauses
0 signed · 45 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.20057openalex-snapshot
Survey propagation: An algorithm for satisfiability
inferredcites →https://doi.org/10.1007/11499107_12openalex-snapshot
Diversification and Determinism in Local Search for Satisfiability
inferredcites →https://doi.org/10.1007/11499107_15openalex-snapshot
Random Walk with Continuously Smoothed Variable Weights
inferredcites →https://doi.org/10.1007/978-3-319-09284-3_23openalex-snapshot
Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses
inferredcites →https://doi.org/10.1007/978-3-540-76928-6_23openalex-snapshot
Advances in Local Search for Satisfiability
inferredcites →https://doi.org/10.1007/978-3-642-14186-7_23openalex-snapshot
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
inferredcites →https://doi.org/10.1007/978-3-642-14186-7_3openalex-snapshot
Improving Stochastic Local Search for SAT with a New Probability Distribution
inferredcites →https://doi.org/10.1007/978-3-642-14186-7_31openalex-snapshot
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
inferredcites →https://doi.org/10.1007/978-3-642-21581-0_24openalex-snapshot
Captain Jack: New Variable Selection Heuristics in Local Search for SAT
inferredcites →https://doi.org/10.1007/978-3-642-31612-8_3openalex-snapshot
Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break
inferredcites →https://doi.org/10.1007/978-3-642-31612-8_43openalex-snapshot
Satisfying versus Falsifying in Local Search for Satisfiability
inferredcites →https://doi.org/10.1007/978-3-642-40627-0_37openalex-snapshot
Focused Random Walk with Configuration Checking and Break Minimum for Satisfiability
inferredcites →https://doi.org/10.1007/s10472-016-9515-9openalex-snapshot
Improving configuration checking for satisfiable random k-SAT instances
inferredcites →https://doi.org/10.1016/j.artint.2011.03.003openalex-snapshot
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
inferredcites →https://doi.org/10.1016/j.artint.2013.09.001openalex-snapshot
Local search for Boolean Satisfiability with configuration checking and subscore
inferredcites →https://doi.org/10.1109/tc.2014.2346196openalex-snapshot
CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
inferredcites →https://doi.org/10.1126/science.1086309openalex-snapshot
Passing Messages Between Disciplines
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1126/science.264.5163.1297openalex-snapshot
Critical Behavior in the Satisfiability of Random Boolean Expressions
inferredcites →https://doi.org/10.14288/1.0051500openalex-snapshot
SATenstein : automatically building local search SAT solvers from components
inferredcites →https://doi.org/10.1609/aaai.v26i1.8133openalex-snapshot
Configuration Checking with Aspiration in Local Search for SAT
inferredcites →https://doi.org/10.1609/aaai.v28i1.9110openalex-snapshot
Double Configuration Checking in Stochastic Local Search for Satisfiability
inferredcites →https://doi.org/10.1613/jair.2490openalex-snapshot
SATzilla: Portfolio-based Algorithm Selection for SAT
inferredcites →https://doi.org/10.1613/jair.2808openalex-snapshot
Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
inferredcites →https://doi.org/10.1613/jair.3907openalex-snapshot
NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
inferredcites →https://doi.org/10.3233/978-1-61499-098-7-570openalex-snapshot
Improving Local Search for Random 3-SAT Using Quantitative Configuration Checking
inferredcites →https://doi.org/10.48550/arxiv.1401.3483openalex-snapshot
Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
inferredcites →https://doi.org/10.5555/1077450.1077456openalex-snapshot
Survey propagation: An algorithm for satisfiability
inferredcites →https://doi.org/10.5555/1122667.1122669openalex-snapshot
Threshold values of random K-SAT from the cavity method
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-58112-1_26openalex-snapshot
PbO-CCSAT: Boosting Local Search for Satisfiability Using Programming by Optimisation
inferred← citeshttps://doi.org/10.1007/s00453-022-00938-8openalex-snapshot
A Refined Branching Algorithm for the Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/s10489-020-01768-3openalex-snapshot
Focused random walk with probability distribution for SAT with long clauses
inferred← citeshttps://doi.org/10.1007/s10489-020-01983-yopenalex-snapshot
More efficient stochastic local search for satisfiability
inferred← citeshttps://doi.org/10.1007/s11432-016-0258-4openalex-snapshot
A randomized diversification strategy for solving satisfiability problem with long clauses
inferred← citeshttps://doi.org/10.1016/j.artint.2016.11.001openalex-snapshot
CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104405openalex-snapshot
Local-MIP: Efficient local search for mixed integer programming
inferred← citeshttps://doi.org/10.1016/j.ins.2021.03.009openalex-snapshot
Emphasis on the flipping variable: Towards effective local search for hard random satisfiability
inferred← citeshttps://doi.org/10.1016/j.ins.2023.119751openalex-snapshot
Improving two-mode algorithm via probabilistic selection for solving satisfiability problem
inferred← citeshttps://doi.org/10.1111/coin.12438openalex-snapshot
Improving stochastic local search for uniform k‐SAT by generating appropriate initial assignment
inferred← citeshttps://doi.org/10.1145/3744915.3748473openalex-snapshot
Exploring the Computational Complexity of Uniform Random Sampling and SAT Counting with Phase Transitions
inferred← citeshttps://doi.org/10.21655/ijsi.1673-7288.00278openalex-snapshot
Branching Strategy Selection Approach Based on Vivification Ratio
inferred← citeshttps://doi.org/10.24963/ijcai.2019/166openalex-snapshot
Resolution and Domination: An Improved Exact MaxSAT Algorithm
inferred← citeshttps://doi.org/10.5121/csit.2016.60600openalex-snapshot
Computer Science & Information Technology ( CS & IT )
inferred← citeshttps://doi.org/10.5121/csit.2016.60607openalex-snapshot
Weights Stagnation in Dynamic Local Search for SAT
inferred← citeshttps://doi.org/10.70675/932a7c81z8d8dz4199z9e7bz02240dcf3998openalex-snapshot
Reasoning and inference for (maximum) satisfiability : new insights
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.