On the public citation graph
Davis-Putnam resolution versus unrestricted resolution
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.
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.1016/0304-3975(77)90054-8openalex-snapshot
On the complexity of regular resolution and the Davis-Putnam procedure
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1016/0304-3975(88)90072-2openalex-snapshot
Resolution proofs of generalized pigeonhole principles
inferredcites →https://doi.org/10.1016/0304-3975(92)90216-3openalex-snapshot
Unrestricted resolution versus N-resolution
inferredcites →https://doi.org/10.1109/sfcs.1988.21951openalex-snapshot
The complexity of the pigeonhole principle
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/48014.48016openalex-snapshot
Many hard examples for resolution
inferredcites →https://doi.org/10.2307/2273702openalex-snapshot
The relative efficiency of propositional proof systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_5openalex-snapshot
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_18openalex-snapshot
Reflections on Proof Complexity and Counting Principles
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_25openalex-snapshot
On Q-Resolution and CDCL QBF Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_25openalex-snapshot
On Expansion and Resolution in CEGAR Based QBF Solving
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1452-8.50109-3openalex-snapshot
Directional Resolution: The Davis-Putnam Procedure, Revisited **This work was partially supported by NSF grant IRI-9157636, by Air Force Office of Scientific Research grant AFOSR 900136, by Toshiba of America, and by a Xerox grant.
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.048openalex-snapshot
Expansion-based QBF solving versus Q-resolution
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00403-1openalex-snapshot
Resolution and binary decision diagrams cannot simulate each other polynomially
inferred← citeshttps://doi.org/10.1017/9781108242066.006openalex-snapshot
Quantified Propositional Calculus
inferred← citeshttps://doi.org/10.1017/9781108242066.008openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.010openalex-snapshot
Basic Example of the Correspondence between Theories and Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.011openalex-snapshot
The Two Worlds of Bounded Arithmetic
inferred← citeshttps://doi.org/10.1017/9781108242066.012openalex-snapshot
Up to EF via the 〈. . .〉 Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.013openalex-snapshot
Examples of Upper Bounds and p-Simulations
inferred← citeshttps://doi.org/10.1017/9781108242066.014openalex-snapshot
Beyond EF via the || . . . || Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.016openalex-snapshot
LKd+1/2 and Combinatorial Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.017openalex-snapshot
Fd and Logical Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.018openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.019openalex-snapshot
Feasible Interpolation: A Framework
inferred← citeshttps://doi.org/10.1017/9781108242066.020openalex-snapshot
Feasible Interpolation: Applications
inferred← citeshttps://doi.org/10.1017/9781108242066.022openalex-snapshot
Model Theory and Lower Bounds
inferred← citeshttps://doi.org/10.1017/9781108242066.024openalex-snapshot
The Nature of Proof Complexity
inferred← citeshttps://doi.org/10.1023/a:1006303512524openalex-snapshot
Resolution versus Search: Two Strategies for SAT
inferred← citeshttps://doi.org/10.1109/lics.2003.1210053openalex-snapshot
The complexity of resolution refinements
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743514openalex-snapshot
Exponential separations between restricted resolution and cutting planes proof systems
inferred← citeshttps://doi.org/10.1137/0222044openalex-snapshot
Regular Resolution Versus Unrestricted Resolution
inferred← citeshttps://doi.org/10.1137/s0097539799352474openalex-snapshot
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
inferred← citeshttps://doi.org/10.1145/509907.509974openalex-snapshot
An exponential separation between regular and general resolution
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1638771/v1openalex-snapshot
Four algorithms for propositional forgetting
inferred← citeshttps://doi.org/10.2178/jsl/1203350790openalex-snapshot
The complexity of resolution refinements
inferred← citeshttps://doi.org/10.21941/kcss/2017/03openalex-snapshot
SAT and CP - Parallelisation and Applications
inferred← citeshttps://doi.org/10.21941/kcss/2017/3openalex-snapshot
SAT and CP - Parallelisation and Applications
inferred← citeshttps://doi.org/10.3233/sat190110openalex-snapshot
On Exponential Lower Bounds for Partially Ordered Resolution
inferred← citeshttps://doi.org/10.48550/arxiv.1404.0703openalex-snapshot
Joins via Geometric Resolutions: Worst-case and Beyond
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.