On the public citation graph

Probabilistic analysis of the pure literal heuristic for the satisfiability problem

https://doi.org/10.1007/bf01874393
0 signed · 28 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0166-218x(83)90017-3openalex-snapshot
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
inferredcites →https://doi.org/10.1137/0210043openalex-snapshot
An Average Time Analysis of Backtracking
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.20104openalex-snapshot
The probabilistic analysis of a greedy satisfiability algorithm
inferred← citeshttps://doi.org/10.1006/jcss.1996.0081openalex-snapshot
A Threshold for Unsatisfiability
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_51openalex-snapshot
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_25openalex-snapshot
A threshold for unsatisfiability
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_423openalex-snapshot
Thresholds of Random k-SAT
inferred← citeshttps://doi.org/10.1007/978-1-4613-3629-7_6openalex-snapshot
Optimization Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/bf01531029openalex-snapshot
The expected complexity of analytic tableaux analyses in propositional calculus ? II
inferred← citeshttps://doi.org/10.1007/bf01531030openalex-snapshot
An average case analysis of a resolution principle algorithm in mechanical theorem proving
inferred← citeshttps://doi.org/10.1007/bf02022095openalex-snapshot
Probabilistic bounds and algorithms for the maximum satisfiability problem
inferred← citeshttps://doi.org/10.1007/bf02186359openalex-snapshot
A selected artificial intelligence bibliography for operations researchers
inferred← citeshttps://doi.org/10.1007/s10955-012-0664-xopenalex-snapshot
Threshold Saturation in Spatially Coupled Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90107-9openalex-snapshot
Proving unsatisfiability for problems with constant cubic sparsity
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90051-7openalex-snapshot
On the probabilistic performance of algorithms for the satisfiability problem
inferred← citeshttps://doi.org/10.1016/0020-0255(87)90003-xopenalex-snapshot
Polynomial-average-time satisfiability problems
inferred← citeshttps://doi.org/10.1016/0305-0548(86)90056-0openalex-snapshot
Some results and experiments in programming techniques for propositional logic
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70535-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00154-2openalex-snapshot
Rigorous results for random (2+p)-SAT
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00313-0openalex-snapshot
Satisfiable Formulas Closed Under Replacement
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03002-7openalex-snapshot
Chapter 2 Satisfiability Solvers
inferred← citeshttps://doi.org/10.1080/00207540802684726openalex-snapshot
Optimising lot sizing and order scheduling with non-linear production rates
inferred← citeshttps://doi.org/10.1137/0215080openalex-snapshot
Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
inferred← citeshttps://doi.org/10.1140/epjb/e2006-00072-6openalex-snapshot
Criticality and universality in the unit-propagation search rule
inferred← citeshttps://doi.org/10.1145/335305.335309openalex-snapshot
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
inferred← citeshttps://doi.org/10.1145/382250.382807openalex-snapshot
Sensitivity of probabilistic results on algorithms for NP-complete problems to input distributions
inferred← citeshttps://doi.org/10.5555/982792.982896openalex-snapshot
The pure literal rule threshold and cores in random hypergraphs
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.