On the public citation graph
The number of 2-sat functions
0 signed · 25 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/jgt.3190160110openalex-snapshot
The maximum number of edges in a minimal graph of diameter 2
inferredcites →https://doi.org/10.1002/rsa.1006openalex-snapshot
The scaling window of the 2‐SAT transition
inferredcites →https://doi.org/10.1006/jcta.1996.0017openalex-snapshot
The Average Number of Linear Extensions of a Partial Order
inferredcites →https://doi.org/10.1007/978-1-4614-7254-4_6openalex-snapshot
Hereditary and Monotone Properties of Graphs
inferredcites →https://doi.org/10.1016/0020-0190(79)90002-4openalex-snapshot
A linear-time algorithm for testing the truth of certain quantified boolean formulas
inferredcites →https://doi.org/10.1016/0097-3165(86)90019-1openalex-snapshot
Some intersection theorems for ordered sets and graphs
inferredcites →https://doi.org/10.1017/s0024609301219274openalex-snapshot
RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) By S VANTE J ANSON , T OMASZ Ł UCZAK and A NDRZEJ R UCIŃSKI : 333 pp., US$48.50, ISBN 0-471-17541-2 (John Wiley & Sons, New York, 2000). RANDOM GRAPHS (Encyclopaedia of Mathematics and its Applications 53) By V. F.…
inferredcites →https://doi.org/10.1017/s0963548300000079openalex-snapshot
Almost all Berge Graphs are Perfect
inferredcites →https://doi.org/10.1090/dimacs/035openalex-snapshot
Satisfiability Problem: Theory and Applications
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0369090-9openalex-snapshot
Asymptotic Enumeration of Partial Orders on a Finite Set
inferredcites →https://doi.org/10.1112/blms/27.5.417openalex-snapshot
Projections of Bodies and Hereditary Properties of Hypergraphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20138openalex-snapshot
How many graphs are unions of k‐cliques?
inferred← citeshttps://doi.org/10.1007/s11856-007-0081-zopenalex-snapshot
Almost every 2-SAT function is unate
inferred← citeshttps://doi.org/10.1007/s11856-012-0056-6openalex-snapshot
The number of 3-SAT functions
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.02.004openalex-snapshot
Turán problems for mixed graphs
inferred← citeshttps://doi.org/10.1017/s096354830900995xopenalex-snapshot
On the Number of 2-SAT Functions
inferred← citeshttps://doi.org/10.1145/3564246.3585123openalex-snapshot
Nearly All 𝑘-SAT Functions Are Unate
inferred← citeshttps://doi.org/10.4213/dm1906openalex-snapshot
Оценки числа биюнктивных функций, инвариантных относительно перестановки переменных. Часть II
inferred← citeshttps://doi.org/10.48550/arxiv.1005.2861openalex-snapshot
The number of 3-SAT functions
inferred← citeshttps://doi.org/10.48550/arxiv.2107.09233openalex-snapshot
Enumerating k-SAT functions
inferred← citeshttps://doi.org/10.7282/t3dr2vjpopenalex-snapshot
Asymptotic enumeration of 2- and 3-SAT functions
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.