On the public citation graph

A Computational Trichotomy for Connectivity of Boolean Satisfiability

0 signed · 42 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.1002/jgt.20514openalex-snapshot
Finding paths between 3-colorings
inferredcites →https://doi.org/10.1007/11786986_31openalex-snapshot
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
inferredcites →https://doi.org/10.1007/978-3-319-06686-8_27openalex-snapshot
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_20openalex-snapshot
On the Boolean Connectivity Problem for Horn Relations
inferredcites →https://doi.org/10.1007/978-3-540-92182-0_6openalex-snapshot
On the Complexity of Reconfiguration Problems
inferredcites →https://doi.org/10.1007/978-3-642-19222-7_7openalex-snapshot
Shortest Paths between Shortest Paths and Independent Sets
inferredcites →https://doi.org/10.1016/j.dam.2010.08.019openalex-snapshot
On the Boolean connectivity problem for Horn relations
inferredcites →https://doi.org/10.1016/j.ipl.2005.06.003openalex-snapshot
Bases for Boolean co-clones
inferredcites →https://doi.org/10.1016/j.jcss.2008.02.005openalex-snapshot
Structure identification of Boolean relations and plain bases for co-clones
inferredcites →https://doi.org/10.1016/j.tcs.2009.08.023openalex-snapshot
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances
inferredcites →https://doi.org/10.1016/s0166-218x(99)00098-0openalex-snapshot
On connected Boolean functions
inferredcites →https://doi.org/10.1103/physrevlett.94.197205openalex-snapshot
Clustering of Solutions in the Random Satisfiability Problem
inferredcites →https://doi.org/10.1109/sfcs.2002.1181990openalex-snapshot
A dichotomy theorem for constraints on a three-element set
inferredcites →https://doi.org/10.1137/07070440xopenalex-snapshot
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
inferredcites →https://doi.org/10.1137/1.9780898718546openalex-snapshot
Complexity Classifications of Boolean Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1137/s0097539794266766openalex-snapshot
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
inferredcites →https://doi.org/10.1145/1132516.1132537openalex-snapshot
On the solution-space geometry of random constraint satisfaction problems
inferredcites →https://doi.org/10.1145/1255443.1255445openalex-snapshot
A new look at survey propagation and its generalizations
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.48550/arxiv.1403.6165openalex-snapshot
The Connectivity of Boolean Satisfiability: No-Constants and Quantified Variants
inferredcites →https://doi.org/10.48550/arxiv.1404.3801openalex-snapshot
Shortest reconfiguration paths in the solution space of Boolean formulas
inferredcites →https://doi.org/10.5555/1070432.1070588openalex-snapshot
A new look at survey propagation and its generalizations

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-031-49611-0_30openalex-snapshot
On Connectedness of Solutions to Integer Linear Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_4openalex-snapshot
Towards an Algebraic Approach to the Reconfiguration CSP
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_27openalex-snapshot
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_10openalex-snapshot
On the Structure of Solution-Graphs for Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_3openalex-snapshot
Solution-Graphs of Boolean Formulas and Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_50openalex-snapshot
Ground State Connectivity of Local Hamiltonians
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_80openalex-snapshot
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
inferred← citeshttps://doi.org/10.1007/s00224-015-9663-zopenalex-snapshot
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
inferred← citeshttps://doi.org/10.1007/s10801-022-01161-yopenalex-snapshot
Recolouring homomorphisms to triangle-free reflexive graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104251openalex-snapshot
Reconfiguring homomorphisms to reflexive graphs via a simple reduction
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.05.028openalex-snapshot
Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.025openalex-snapshot
Trichotomy for the reconfiguration problem of integer linear systems
inferred← citeshttps://doi.org/10.1137/17m1122578openalex-snapshot
Homomorphism Reconfiguration via Homotopy
inferred← citeshttps://doi.org/10.1145/3186587openalex-snapshot
Ground State Connectivity of Local Hamiltonians
inferred← citeshttps://doi.org/10.3233/sat190113openalex-snapshot
Solution-Graphs of Boolean Formulas and Isomorphism1
inferred← citeshttps://doi.org/10.3390/a11040052openalex-snapshot
Introduction to Reconfiguration
inferred← citeshttps://doi.org/10.37236/7458openalex-snapshot
Reconfiguration on Nowhere Dense Graph Classes
inferred← citeshttps://doi.org/10.48550/arxiv.1911.02786openalex-snapshot
Trichotomy for the reconfiguration problem of integer linear systems
inferred← citeshttps://doi.org/10.70675/1d366b25z29b0z4b44zaef4z87e889a6ee49openalex-snapshot
Graph domination and reconfiguration problems
inferred← citeshttps://doi.org/10.70675/81cccf81zb873z4003za275zb21b3505db2eopenalex-snapshot
Reconfiguration problems in graphs
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.