On the public citation graph

Size-Space Tradeoffs for Resolution

0 signed · 52 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.1002/rsa.10089openalex-snapshot
Space complexity of random formulae in resolution
inferredcites →https://doi.org/10.1006/inco.2001.2921openalex-snapshot
Space Bounds for Resolution
inferredcites →https://doi.org/10.1007/s00493-004-0030-yopenalex-snapshot
Regular Resolution Lower Bounds For The Weak Pigeonhole Principle
inferredcites →https://doi.org/10.1007/s00493-004-0036-5openalex-snapshot
Near Optimal Separation Of Tree-Like And General Resolution
inferredcites →https://doi.org/10.1007/s004930050062openalex-snapshot
Separation of the Monotone NC Hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1016/s0022-0000(76)80048-7openalex-snapshot
Storage requirements for deterministic polynomialtime recognizable languages
inferredcites →https://doi.org/10.1109/ccc.2002.1004320openalex-snapshot
Resolution lower bounds for the weak pigeon hole principle
inferredcites →https://doi.org/10.1137/0206031openalex-snapshot
On Resolution with Clauses of Bounded Size
inferredcites →https://doi.org/10.1137/s0097539700366735openalex-snapshot
Space Complexity in Propositional Calculus
inferredcites →https://doi.org/10.1137/s0097539700369156openalex-snapshot
The Efficiency of Resolution and Davis--Putnam Procedures
inferredcites →https://doi.org/10.1137/s0097539799352474openalex-snapshot
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/322003.322015openalex-snapshot
On Time Versus Space
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/375827.375835openalex-snapshot
Short proofs are narrow—resolution made simple
inferredcites →https://doi.org/10.1145/48014.48016openalex-snapshot
Many hard examples for resolution
inferredcites →https://doi.org/10.1145/7531.8928openalex-snapshot
Hard examples for resolution

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-030-24258-9_5openalex-snapshot
DRAT Proofs, Propagation Redundancy, and Extended Resolution
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_5openalex-snapshot
Exponential Separations in a Hierarchy of Clause Learning Proof Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_37openalex-snapshot
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_62openalex-snapshot
Revisiting Space in Proof Complexity: Treewidth and Pathwidth
inferred← citeshttps://doi.org/10.1007/s00037-017-0163-1openalex-snapshot
On Space and Depth in Resolution
inferred← citeshttps://doi.org/10.1007/s00037-020-00201-yopenalex-snapshot
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
inferred← citeshttps://doi.org/10.1016/j.ic.2017.05.005openalex-snapshot
The treewidth of proofs
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.04.006openalex-snapshot
Space characterizations of complexity measures and size-space trade-offs in propositional proof systems
inferred← citeshttps://doi.org/10.1109/ccc.2010.22openalex-snapshot
On the Relative Strength of Pebbling and Resolution
inferred← citeshttps://doi.org/10.1109/ccc.2012.27openalex-snapshot
Space Complexity in Polynomial Calculus
inferred← citeshttps://doi.org/10.1109/ccc.2013.22openalex-snapshot
Just a Pebble Game
inferred← citeshttps://doi.org/10.1109/ccc.2014.36openalex-snapshot
Narrow Proofs May Be Maximally Long
inferred← citeshttps://doi.org/10.1109/focs.2016.40openalex-snapshot
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00111openalex-snapshot
Separations in Proof Complexity and TFNP
inferred← citeshttps://doi.org/10.1137/080713513openalex-snapshot
The PSPACE-Completeness of Black-White Pebbling
inferred← citeshttps://doi.org/10.1137/120895950openalex-snapshot
Space Complexity in Polynomial Calculus
inferred← citeshttps://doi.org/10.1137/16m1109072openalex-snapshot
Supercritical Space-Width Trade-offs for Resolution
inferred← citeshttps://doi.org/10.1145/1374376.1374478openalex-snapshot
Towards an optimal separation of space and length in resolution
inferred← citeshttps://doi.org/10.1145/2159531.2159538openalex-snapshot
On the Relative Strength of Pebbling and Resolution
inferred← citeshttps://doi.org/10.1145/2213977.2214000openalex-snapshot
On the virtue of succinct proofs
inferred← citeshttps://doi.org/10.1145/2488608.2488711openalex-snapshot
Some trade-off results for polynomial calculus
inferred← citeshttps://doi.org/10.1145/2746339openalex-snapshot
From Small Space to Small Width in Resolution
inferred← citeshttps://doi.org/10.1145/2815493.2815497openalex-snapshot
On the interplay between proof complexity and SAT solving
inferred← citeshttps://doi.org/10.1145/2858790openalex-snapshot
A New Kind of Tradeoffs in Propositional Proof Complexity
inferred← citeshttps://doi.org/10.1145/2898435openalex-snapshot
Narrow Proofs May Be Maximally Long
inferred← citeshttps://doi.org/10.1145/3195257openalex-snapshot
Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler–Leman Refinement Steps
inferred← citeshttps://doi.org/10.1145/3565363openalex-snapshot
MaxSAT Resolution and Subcube Sums
inferred← citeshttps://doi.org/10.1145/3663758openalex-snapshot
Separations in Proof Complexity and TFNP
inferred← citeshttps://doi.org/10.1613/jair.4260openalex-snapshot
Improved Separations of Regular Resolution from Clause Learning Proof Systems
inferred← citeshttps://doi.org/10.23638/lmcs-17(2:12)2021openalex-snapshot
DRAT and Propagation Redundancy Proofs Without New Variables
inferred← citeshttps://doi.org/10.4086/toc.2013.v009a014openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2016.v012a005openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.1008.1789openalex-snapshot
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions
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.