On the public citation graph
Space Complexity in Polynomial Calculus
0 signed · 66 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/rsa.10089openalex-snapshot
Space complexity of random formulae in resolution
inferredcites →https://doi.org/10.1006/jcss.2000.1726openalex-snapshot
Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes
inferredcites →https://doi.org/10.1007/s00037-010-0293-1openalex-snapshot
Random Cnf’s are Hard for the Polynomial Calculus
inferredcites →https://doi.org/10.1007/s000370050013openalex-snapshot
Lower bounds for the polynomial calculus
inferredcites →https://doi.org/10.1007/s000370050024openalex-snapshot
Lower bounds for the polynomial calculus and the Gröbner basis algorithm
inferredcites →https://doi.org/10.1016/0166-218x(87)90039-4openalex-snapshot
On the complexity of cutting-plane proofs
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1016/j.artint.2010.10.002openalex-snapshot
On the power of clause-learning SAT solvers as resolution engines
inferredcites →https://doi.org/10.1016/j.ipl.2009.06.006openalex-snapshot
A simplified way of proving trade-off results for resolution
inferredcites →https://doi.org/10.1016/j.jcss.2007.06.025openalex-snapshot
A combinatorial characterization of resolution width
inferredcites →https://doi.org/10.1016/j.jpaa.2008.11.043openalex-snapshot
New developments in the theory of Gröbner bases and applications to formal verification
inferredcites →https://doi.org/10.1016/j.jsc.2008.02.017openalex-snapshot
PolyBoRi: A framework for Gröbner-basis computations with Boolean polynomials
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1137/060668250openalex-snapshot
Narrow Proofs May Be Spacious:Separating Space and Width in Resolution
inferredcites →https://doi.org/10.1137/080723880openalex-snapshot
Size-Space Tradeoffs for Resolution
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.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/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.1613/jair.3152openalex-snapshot
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
inferredcites →https://doi.org/10.2168/lmcs-9(3:15)2013openalex-snapshot
Pebble Games, Proof Complexity, and Time-Space Trade-offs
inferredcites →https://doi.org/10.2178/bsl/1203350879openalex-snapshot
The Complexity of Propositional Proofs
inferredcites →https://doi.org/10.2307/2273702openalex-snapshot
The relative efficiency of propositional proof systems
inferredcites →https://doi.org/10.2307/2275583openalex-snapshot
Lower bounds for resolution and cutting plane proofs and monotone computations
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-61792-9_27openalex-snapshot
Sherali-Adams and the Binary Encoding of Combinatorial Principles
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.04.007openalex-snapshot
On semantic cutting planes with very small coefficients
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.1109/focs.2019.00081openalex-snapshot
Polynomial Calculus Space and Resolution Width
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00011openalex-snapshot
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity
inferred← citeshttps://doi.org/10.1137/20m134784xopenalex-snapshot
Proof Complexity and the Binary Encoding of Combinatorial Principles
inferred← citeshttps://doi.org/10.48550/arxiv.1809.02843openalex-snapshot
Resolution and the binary encoding of combinatorial principles
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.