On the public citation graph
Statistical physics analysis of the computational complexity of solving random satisfiability problems using backtrack algorithms
0 signed · 89 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.1007/978-1-4899-1421-7openalex-snapshot
Scale Invariance, Interfaces, and Non-Equilibrium Dynamics
inferredcites →https://doi.org/10.1016/0893-6080(94)90014-0openalex-snapshot
Introduction to the theory of neural computation
inferredcites →https://doi.org/10.1016/s0304-3975(01)00154-2openalex-snapshot
Rigorous results for random (2+p)-SAT
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.1090/dimacs/035openalex-snapshot
Satisfiability Problem: Theory and Applications
inferredcites →https://doi.org/10.1103/physrevlett.86.1654openalex-snapshot
Trajectories in Phase Diagrams, Growth Processes, and Computational Complexity: How Search Algorithms Solve the 3-Satisfiability Problem
inferredcites →https://doi.org/10.1103/physrevlett.86.1658openalex-snapshot
Typical Solution Time for a Vertex-Covering Algorithm on Finite-Connectivity Random Graphs
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1201/9780429499661openalex-snapshot
Introduction to the Theory of Neural Computation
inferredcites →https://doi.org/10.13182/nse68-a19548openalex-snapshot
The Art of Computer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11538462_34openalex-snapshot
A Generating Function Method for the Average-Case Analysis of DPLL
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_12openalex-snapshot
Random 3-SAT: The Plot Thickens
inferred← citeshttps://doi.org/10.1007/978-3-0348-7865-4_11openalex-snapshot
A Polly Cracker System Based on Satisfiability
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/978-3-540-44485-5_11openalex-snapshot
On the Analysis of Backtrack Proceduresfor the Colouring of Random Graphs
inferred← citeshttps://doi.org/10.1007/s10472-004-9426-zopenalex-snapshot
Restarts and Exponential Acceleration of the Davis?Putnam?Loveland?Logemann Algorithm: A Large Deviation Analysis of the Generalized Unit Clause Heuristic for Random 3-SAT
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.02.034openalex-snapshot
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
inferred← citeshttps://doi.org/10.1016/s0378-4371(02)00516-2openalex-snapshot
Phase transitions and complexity in computer science: an overview of the statistical physics approach to the random satisfiability problem
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.1023/a:1025671026963openalex-snapshot
Random 3-SAT: The Plot Thickens
inferred← citeshttps://doi.org/10.1088/0305-4470/35/5/301openalex-snapshot
Jamming model for the extremal optimization heuristic
inferred← citeshttps://doi.org/10.1088/0305-4470/36/43/027openalex-snapshot
The dynamics of proving uncolourability of large random graphs: I. Symmetric colouring heuristic
inferred← citeshttps://doi.org/10.1088/1742-5468/ac66d0openalex-snapshot
Uncovering the non-equilibrium stationary properties in sparse Boolean networks
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.001.0001openalex-snapshot
Information, Physics, and Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0001openalex-snapshot
Introduction to information theory
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0002openalex-snapshot
Statistical physics and probability theory
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0003openalex-snapshot
Introduction to combinatorial optimization
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0004openalex-snapshot
A probabilistic toolbox
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0005openalex-snapshot
The random energy model
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0006openalex-snapshot
The random code ensemble
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0007openalex-snapshot
Number partitioning
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0008openalex-snapshot
Introduction to replica theory
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0009openalex-snapshot
Factor graphs and graph ensembles
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0010openalex-snapshot
Satisfiability
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0011openalex-snapshot
Low-density parity-check codes
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0012openalex-snapshot
Spin glasses
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0013openalex-snapshot
Bridges: Inference and the Monte Carlo method
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0014openalex-snapshot
Belief propogation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0015openalex-snapshot
Decoding with belief propagation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0016openalex-snapshot
The assignment problem
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0017openalex-snapshot
Ising models on random graph
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0018openalex-snapshot
Linear equations with Boolean variables
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0019openalex-snapshot
The 1RSB cavity method
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0020openalex-snapshot
Random K-satisfiability
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0021openalex-snapshot
Glassy states in coding theory
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0022openalex-snapshot
An ongoing story
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.005.0001openalex-snapshot
Symbols and notation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.001.0001openalex-snapshot
The Nature of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0006openalex-snapshot
Figure Credits
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0003openalex-snapshot
Insights and Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0004openalex-snapshot
Needles in a Haystack: the Class NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0005openalex-snapshot
Who is the Hardest One of All? NP-Completeness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0006openalex-snapshot
The Deep Question: P vs. NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0007openalex-snapshot
The Grand Unified Theory of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0008openalex-snapshot
Memory, Paths, and Games
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0009openalex-snapshot
Optimization and Approximation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0010openalex-snapshot
Randomized Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0011openalex-snapshot
Interaction and Pseudorandomness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0012openalex-snapshot
Random Walks and Rapid Mixing
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0013openalex-snapshot
Counting, Sampling, and Statistical Physics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0014openalex-snapshot
When Formulas Freeze: Phase Transitions in Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0015openalex-snapshot
Quantum Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.005.0001openalex-snapshot
Mathematical Tools
inferred← citeshttps://doi.org/10.1103/physreve.104.045313openalex-snapshot
Overcoming the complexity barrier of the dynamic message-passing method in networks with fat-tailed degree distributions
inferred← citeshttps://doi.org/10.1103/physreve.66.037101openalex-snapshot
Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions
inferred← citeshttps://doi.org/10.1103/physreve.67.066103openalex-snapshot
Relaxation and metastability in a local search procedure for the random satisfiability problem
inferred← citeshttps://doi.org/10.1103/physreve.67.066104openalex-snapshot
Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms
inferred← citeshttps://doi.org/10.1103/physreve.69.066703openalex-snapshot
Extremal optimization at the phase transition of the three-coloring problem
inferred← citeshttps://doi.org/10.1103/physreve.99.022310openalex-snapshot
Minimal sets to destroy the k -core in random networks
inferred← citeshttps://doi.org/10.1103/physrevlett.88.178701openalex-snapshot
Optimizing Searches via Rare Events
inferred← citeshttps://doi.org/10.1109/5992.998639openalex-snapshot
Computational complexity for physicists
inferred← citeshttps://doi.org/10.1109/icrc.2016.7738680openalex-snapshot
Opportunities in physical computing driven by analog realization
inferred← citeshttps://doi.org/10.1117/12.602741openalex-snapshot
Exploiting phase transitions for fusion optimization problems
inferred← citeshttps://doi.org/10.1613/jair.1681openalex-snapshot
Hiding Satisfying Assignments: Two are Better than One
inferred← citeshttps://doi.org/10.17762/itii.v7i2.67openalex-snapshot
Exploration of Hard to Solve 3-sat Problems
inferred← citeshttps://doi.org/10.3390/jlpea11020014openalex-snapshot
Physical Computing: Unifying Real Number Computation to Enable Energy Efficient Computing
inferred← citeshttps://doi.org/10.48550/arxiv.cond-mat/0012185openalex-snapshot
Computational Complexity for Physicists
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0503046openalex-snapshot
Hiding Satisfying Assignments: Two are Better than One
inferred← citeshttps://doi.org/10.5121/csit.2019.90904openalex-snapshot
Efficient Tough Random Symmetric 3-SAT Generator
inferred← citeshttps://doi.org/10.5555/1622519.1622535openalex-snapshot
Hiding satisfying assignments
inferred← citeshttps://doi.org/10.70675/fbf69f26zd1faz41c6z9e7bza2cd4dbaaabdopenalex-snapshot
Statistical Physics of Sparse and Dense Models in Optimization and Inference
inferred← citeshttps://doi.org/10.7566/jpsj.86.073001openalex-snapshot
An Exact Algorithm Exhibiting RS–RSB/Easy–Hard Correspondence for the Maximum Independent Set Problem
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.