On the public citation graph

On Linear CNF Formulas

0 signed · 24 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/11814948_22openalex-snapshot
On Linear CNF Formulas
inferredcites →https://doi.org/10.1007/978-3-7091-2301-0_3openalex-snapshot
Graphen und Matrizen
inferredcites →https://doi.org/10.1007/bf02127976openalex-snapshot
A fast parallel SAT-solver — efficient workload balancing
inferredcites →https://doi.org/10.1016/0012-365x(93)90179-wopenalex-snapshot
A short proof of fisher's inequality
inferredcites →https://doi.org/10.1016/0021-8693(68)90099-9openalex-snapshot
An extension of a theorem of de Bruijn and Erdös on combinatorial designs
inferredcites →https://doi.org/10.1016/0097-3165(72)90029-5openalex-snapshot
An existence theory for pairwise balanced designs II. The structure of PBD-closed sets and the existence conjectures
inferredcites →https://doi.org/10.1016/0166-218x(84)90081-7openalex-snapshot
A simplified NP-complete satisfiability problem
inferredcites →https://doi.org/10.1016/s0166-218x(01)00358-4openalex-snapshot
A perspective on certain polynomial-time solvable classes of satisfiability
inferredcites →https://doi.org/10.1038/22055openalex-snapshot
Determining computational complexity from characteristic ‘phase transitions’
inferredcites →https://doi.org/10.1109/sfcs.1975.5openalex-snapshot
An O (N2.5) algorithm for maximum matching in general graphs
inferredcites →https://doi.org/10.1112/blms/19.3.273bopenalex-snapshot
COMBINATORICS Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability
inferredcites →https://doi.org/10.1112/jlms/s1-10.37.26openalex-snapshot
On Representatives of Subsets
inferredcites →https://doi.org/10.5948/upo9781614440147openalex-snapshot
Combinatorial Mathematics

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-319-28702-7_5openalex-snapshot
Combinatorial Results on Directed Hypergraphs for the SAT Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-69311-6_11openalex-snapshot
NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT ≥ k ,r-UNLSAT ≥ k )
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_56openalex-snapshot
The Existence of Unsatisfiable Formulas in k-LCNF for k ≥ 3
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_22openalex-snapshot
A CNF Class Generalizing Exact Linear Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_3openalex-snapshot
The Lovász Local Lemma and Satisfiability
inferred← citeshttps://doi.org/10.1016/j.dam.2008.03.031openalex-snapshot
Linear CNF formulas and satisfiability
inferred← citeshttps://doi.org/10.1109/icycs.2008.154openalex-snapshot
Hardness of Approximation Algorithms on k-SAT and (k,s)-SAT Problems
inferred← citeshttps://doi.org/10.3929/ethz-a-006550605openalex-snapshot
Algorithms and Extremal Properties of SAT and CSP
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2490openalex-snapshot
Unsatisfiable Linear CNF Formulas Are Large and Complex
inferred← citeshttps://doi.org/10.48550/arxiv.0708.2336openalex-snapshot
Unsatisfiable Linear k-CNFs Exist, for every k
showing the first 10 of 11 · page through all 11
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.