On the public citation graph
A Generating Function Method for the Average-Case Analysis of DPLL
0 signed · 30 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.10089openalex-snapshot
Space complexity of random formulae in resolution
inferredcites →https://doi.org/10.1006/jagm.1996.0016openalex-snapshot
Analysis of Two Simple Heuristics on a Random Instance ofk-sat
inferredcites →https://doi.org/10.1007/3-540-45749-6_51openalex-snapshot
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
inferredcites →https://doi.org/10.1007/978-3-030-80627-9_7openalex-snapshot
Algorithms and Complexity
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_58openalex-snapshot
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
inferredcites →https://doi.org/10.1007/s100510170101openalex-snapshot
Statistical physics analysis of the computational complexity of solving random satisfiability problems using backtrack algorithms
inferredcites →https://doi.org/10.1016/0004-3702(94)90109-0openalex-snapshot
Easy problems are sometimes hard
inferredcites →https://doi.org/10.1016/0020-0255(90)90030-eopenalex-snapshot
Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem
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.1016/j.tcs.2004.02.034openalex-snapshot
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
inferredcites →https://doi.org/10.1016/s0304-3975(01)00158-xopenalex-snapshot
Results related to threshold phenomena research in satisfiability: lower bounds
inferredcites →https://doi.org/10.1016/s0304-3975(01)00159-1openalex-snapshot
Lower bounds for random 3-SAT via differential equations
inferredcites →https://doi.org/10.1088/0305-4470/36/43/027openalex-snapshot
The dynamics of proving uncolourability of large random graphs: I. Symmetric colouring heuristic
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0373371-6openalex-snapshot
Estimating the efficiency of backtrack programs
inferredcites →https://doi.org/10.1109/sfcs.1997.646109openalex-snapshot
The analysis of a list-coloring algorithm on a random graph
inferredcites →https://doi.org/10.1137/0215080openalex-snapshot
Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
inferredcites →https://doi.org/10.1137/s0097539792230484openalex-snapshot
A Variational Method for Analysing Unit Clause Search
inferredcites →https://doi.org/10.1145/276698.276870openalex-snapshot
On the complexity of unsatisfiability proofs for random k-CNF formulas
inferredcites →https://doi.org/10.1145/380752.380820openalex-snapshot
A sharp threshold in proof complexity
inferredcites →https://doi.org/10.1145/48014.48016openalex-snapshot
Many hard examples for resolution
inferredcites →https://doi.org/10.48550/arxiv.cond-mat/0412489openalex-snapshot
How much backtracking does it take to color random graphs? Rigorous results on heavy tails
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.06.003openalex-snapshot
Average-case complexity of backtrack search for coloring sparse random graphs
inferred← citeshttps://doi.org/10.1016/s0924-8099(07)80008-4openalex-snapshot
Course 1 Introduction to phase transitions in random optimization problems
inferred← citeshttps://doi.org/10.1214/24-aap2076openalex-snapshot
Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
inferred← citeshttps://doi.org/10.1613/jair.1681openalex-snapshot
Hiding Satisfying Assignments: Two are Better than One
inferred← citeshttps://doi.org/10.48550/arxiv.0802.1829openalex-snapshot
A review of the Statistical Mechanics approach to Random Optimization Problems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0503046openalex-snapshot
Hiding Satisfying Assignments: Two are Better than One
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.