On the public citation graph

Structure identification of Boolean relations and plain bases for co-clones

0 signed · 56 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.1007/978-3-0348-5547-1openalex-snapshot
Funktionen- und Relationenalgebren
inferredcites →https://doi.org/10.1007/978-3-540-92800-3_9openalex-snapshot
Partial Polymorphisms and Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1016/0004-3702(92)90009-mopenalex-snapshot
Structure identification in relational data
inferredcites →https://doi.org/10.1016/j.engappai.2004.08.021openalex-snapshot
Constraint processing
inferredcites →https://doi.org/10.1016/j.ipl.2005.06.003openalex-snapshot
Bases for Boolean co-clones
inferredcites →https://doi.org/10.1016/s0020-0190(01)00247-2openalex-snapshot
A unified framework for structure identification
inferredcites →https://doi.org/10.1137/1.9780898718546openalex-snapshot
Complexity Classifications of Boolean Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1137/s0097539795285114openalex-snapshot
The Inverse Satisfiability Problem
inferredcites →https://doi.org/10.1137/s0097539798345944openalex-snapshot
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.1145/954092.954101openalex-snapshot
SIGACT news complexity theory column 42
inferredcites →https://doi.org/10.1145/992287.992296openalex-snapshot
Quantum search algorithms
inferredcites →https://doi.org/10.1515/9781400882366openalex-snapshot
The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
inferredcites →https://doi.org/10.2140/pjm.1968.27.95openalex-snapshot
Closed systems of functions and predicates
inferredcites →https://doi.org/10.4230/dagsemproc.06401.7openalex-snapshot
New Algebraic Tools for Constraint Satisfaction
inferredcites →https://doi.org/10.5860/choice.33-0359openalex-snapshot
Foundations of databases

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-540-87531-4_10openalex-snapshot
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_2openalex-snapshot
Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_4openalex-snapshot
Testing Expressibility Is Hard
inferred← citeshttps://doi.org/10.1007/978-3-642-33974-5_1openalex-snapshot
Background
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_56openalex-snapshot
Give Me Another One!
inferred← citeshttps://doi.org/10.1007/s00012-015-0330-7openalex-snapshot
Dichotomy on intervals of strong partial Boolean clones
inferred← citeshttps://doi.org/10.1007/s00012-015-0336-1openalex-snapshot
Boolean max-co-clones
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/s00224-018-9896-8openalex-snapshot
Minimal Distance of Propositional Models
inferred← citeshttps://doi.org/10.1016/j.dam.2025.01.001openalex-snapshot
Positive existential definability in finite structures
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.03.011openalex-snapshot
Weak bases of Boolean co-clones
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.12.003openalex-snapshot
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.10.004openalex-snapshot
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.008openalex-snapshot
The complexity of counting locally maximal satisfying assignments of Boolean CSPs
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.03.006openalex-snapshot
Gap theorems for robust satisfiability: Boolean CSPs and beyond
inferred← citeshttps://doi.org/10.1093/logcom/exw005openalex-snapshot
The power of primitive positive definitions with polynomially many variables
inferred← citeshttps://doi.org/10.1103/physreva.86.030301openalex-snapshot
Undecidability in tensor network states
inferred← citeshttps://doi.org/10.1109/ismvl.2009.10openalex-snapshot
Frozen Boolean Partial Co-clones
inferred← citeshttps://doi.org/10.1109/ismvl.2013.16openalex-snapshot
Boolean Max-Co-Clones
inferred← citeshttps://doi.org/10.1109/ismvl.2014.23openalex-snapshot
Polynomially Closed Co-clones
inferred← citeshttps://doi.org/10.1137/1.9781611976465.11openalex-snapshot
Solving hard cut problems via flow-augmentation
inferred← citeshttps://doi.org/10.1137/19m1291054openalex-snapshot
Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
inferred← citeshttps://doi.org/10.1137/23m1553698openalex-snapshot
Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints
inferred← citeshttps://doi.org/10.1145/1805950.1805954openalex-snapshot
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
inferred← citeshttps://doi.org/10.1145/1870103.1870105openalex-snapshot
Epistemic privacy
inferred← citeshttps://doi.org/10.1145/2448496.2448514openalex-snapshot
Definability problems for graph query languages
inferred← citeshttps://doi.org/10.1145/2450142.2450146openalex-snapshot
The complexity of conservative valued CSPs
inferred← citeshttps://doi.org/10.1145/2528401openalex-snapshot
The expressibility of functions on the boolean domain, with applications to counting CSPs
inferred← citeshttps://doi.org/10.1145/2629421openalex-snapshot
Complexity Classifications for Logic-Based Argumentation
inferred← citeshttps://doi.org/10.1145/2858787openalex-snapshot
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
inferred← citeshttps://doi.org/10.22028/d291-26018openalex-snapshot
Kernelization of generic problems : upper and lower bounds
inferred← citeshttps://doi.org/10.3233/sat190097openalex-snapshot
A Computational Trichotomy for Connectivity of Boolean Satisfiability
inferred← citeshttps://doi.org/10.3384/diss.diva-122827openalex-snapshot
Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2015.161openalex-snapshot
The Product Homomorphism Problem and Applications
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.36openalex-snapshot
On the Strength of Uniqueness Quantification in Primitive Positive Formulas
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2012.302openalex-snapshot
Log-supermodular functions, functional clones and counting CSPs
inferred← citeshttps://doi.org/10.48550/arxiv.1210.3344openalex-snapshot
Galois correspondence for counting quantifiers
inferred← citeshttps://doi.org/10.48550/arxiv.1312.6679openalex-snapshot
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
inferred← citeshttps://doi.org/10.48550/arxiv.1902.04740openalex-snapshot
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
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.