On the public citation graph

A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities

https://doi.org/10.1007/bf01580586
0 signed · 45 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/bf01940892openalex-snapshot
A transitive closure algorithm
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1007/bfb0120687openalex-snapshot
Branch and bound experiments in zero-one programming
inferredcites →https://doi.org/10.1007/bfb0120883openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1016/0020-0190(71)90006-8openalex-snapshot
Efficient determination of the transitive closure of a directed graph
inferredcites →https://doi.org/10.1016/0020-0190(76)90079-xopenalex-snapshot
A cascade algorithm for the logical closure of a set of binary relations
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/0020-0190(86)90021-9openalex-snapshot
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
inferredcites →https://doi.org/10.1016/0166-218x(85)90068-xopenalex-snapshot
Uniquely solvable quadratic boolean equations
inferredcites →https://doi.org/10.1016/0196-6774(80)90017-6openalex-snapshot
Linear expected-time algorithms for connectivity problems
inferredcites →https://doi.org/10.1016/s0304-0208(08)72450-2openalex-snapshot
Degree-two Inequalities, Clique Facets, and Biperfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1109/swat.1971.4openalex-snapshot
Boolean matrix multiplication and transitive closure
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0211038openalex-snapshot
On the Asymptotic Complexity of Matrix Multiplication
inferredcites →https://doi.org/10.1145/321105.321107openalex-snapshot
A Theorem on Boolean Matrices
inferredcites →https://doi.org/10.1287/opre.29.1.49openalex-snapshot
Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
inferredcites →https://doi.org/10.1287/opre.31.5.803openalex-snapshot
Solving Large-Scale Zero-One Linear Programming Problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jcss.1996.0081openalex-snapshot
A Threshold for Unsatisfiability
inferred← citeshttps://doi.org/10.1007/3-540-48051-x_25openalex-snapshot
A Parallel Transitive Closure Computation Algorithm for VLSI Test Generation
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_25openalex-snapshot
A threshold for unsatisfiability
inferred← citeshttps://doi.org/10.1007/978-1-4615-3958-2_10openalex-snapshot
Transitive Closure And Testing
inferred← citeshttps://doi.org/10.1007/978-1-4615-3958-2_8openalex-snapshot
Neural Computers
inferred← citeshttps://doi.org/10.1007/978-1-4615-3958-2_9openalex-snapshot
Quadratic 0-1 Programming
inferred← citeshttps://doi.org/10.1007/bf01531068openalex-snapshot
Polynomial-time inference of all valid implications for Horn and related formulae
inferred← citeshttps://doi.org/10.1007/bf01582889openalex-snapshot
An analytical approach to global optimization
inferred← citeshttps://doi.org/10.1007/bf01896987openalex-snapshot
Minimum sum of diameters clustering
inferred← citeshttps://doi.org/10.1007/bf02186359openalex-snapshot
A selected artificial intelligence bibliography for operations researchers
inferred← citeshttps://doi.org/10.1007/bf02241270openalex-snapshot
Algorithms for the maximum satisfiability problem
inferred← citeshttps://doi.org/10.1007/bf02283686openalex-snapshot
Computational experience with an interior point algorithm on the satisfiability problem
inferred← citeshttps://doi.org/10.1007/bf02592194openalex-snapshot
Binary integer programs with two variables per inequality
inferred← citeshttps://doi.org/10.1007/bfb0023767openalex-snapshot
Logical inference and polyhedral projection
inferred← citeshttps://doi.org/10.1007/bfb0083461openalex-snapshot
Quadratic functions of binary variables
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90068-xopenalex-snapshot
Uniquely solvable quadratic boolean equations
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90020-dopenalex-snapshot
On the r,s-SAT satisfiability problem and a conjecture of Tovey
inferred← citeshttps://doi.org/10.1016/0167-6377(89)90043-6openalex-snapshot
A decomposition method for minimizing quadratic pseudo-Boolean functions
inferred← citeshttps://doi.org/10.1016/0167-9236(86)90118-1openalex-snapshot
A graph representation for management of logic models
inferred← citeshttps://doi.org/10.1016/0167-9236(88)90097-8openalex-snapshot
A quantitative approach to logical inference
inferred← citeshttps://doi.org/10.1016/0305-0548(90)90062-copenalex-snapshot
Modeling and integer programming techniques applied to propositional calculus
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.08.025openalex-snapshot
Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
inferred← citeshttps://doi.org/10.1051/ro/1987210402871openalex-snapshot
Product form parametric representation of the solutions to a quadratic boolean equation
inferred← citeshttps://doi.org/10.1051/ro/1991250302411openalex-snapshot
Experimental comparison of 2-satisfiability algorithms
inferred← citeshttps://doi.org/10.1090/dimacs/026/23openalex-snapshot
Efficiency and stability of hypergraph SAT algorithms
inferred← citeshttps://doi.org/10.1109/43.238038openalex-snapshot
A transitive closure algorithm for test generation
inferred← citeshttps://doi.org/10.1145/127601.127693openalex-snapshot
A transitive closure based algorithm for test generation
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.