On the public citation graph
Proof Complexity Meets Algebra
0 signed · 59 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.3240070103openalex-snapshot
An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
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/3-540-45841-7_34openalex-snapshot
Complexity of Semi-algebraic Proofs
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_9openalex-snapshot
Constraint Propagation as a Proof System
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/j.jcss.2007.06.025openalex-snapshot
A combinatorial characterization of resolution width
inferredcites →https://doi.org/10.1016/j.tcs.2008.12.049openalex-snapshot
Affine systems of equations and counting infinitary logic
inferredcites →https://doi.org/10.1016/s0304-3975(00)00157-2openalex-snapshot
Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
inferredcites →https://doi.org/10.1016/s0304-3975(02)00446-2openalex-snapshot
Algebraic proof systems over formulas
inferredcites →https://doi.org/10.1017/bsl.2015.25openalex-snapshot
THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA
inferredcites →https://doi.org/10.1017/cbo9781107325944.010openalex-snapshot
On the Complexity of the Propositional Calculus
inferredcites →https://doi.org/10.1090/dimacs/031/07openalex-snapshot
Algebraic propositional proof systems
inferredcites →https://doi.org/10.1090/s0273-0979-06-01126-8openalex-snapshot
Expander graphs and their applications
inferredcites →https://doi.org/10.1109/focs.2008.74openalex-snapshot
Linear Level Lasserre Lower Bounds for Certain k-CSPs
inferredcites →https://doi.org/10.1109/focs.2017.37openalex-snapshot
A Dichotomy Theorem for Nonuniform CSPs
inferredcites →https://doi.org/10.1109/focs.2017.38openalex-snapshot
A Proof of CSP Dichotomy Conjecture
inferredcites →https://doi.org/10.1109/lics.2017.8005087openalex-snapshot
The limits of SDP relaxations for general-valued CSPs
inferredcites →https://doi.org/10.1109/sfcs.1988.21951openalex-snapshot
The complexity of the pigeonhole principle
inferredcites →https://doi.org/10.1109/sfcs.2001.959893openalex-snapshot
Lower bounds for polynomial calculus: non-binomial case
inferredcites →https://doi.org/10.1109/sfcs.2002.1181884openalex-snapshot
Explicit unique-neighbor expanders
inferredcites →https://doi.org/10.1112/plms/s3-73.1.1openalex-snapshot
Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs
inferredcites →https://doi.org/10.1137/0403036openalex-snapshot
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
inferredcites →https://doi.org/10.1137/0801013openalex-snapshot
Cones of Matrices and Set-Functions and 0–1 Optimization
inferredcites →https://doi.org/10.1137/090775646openalex-snapshot
Tractability and Learnability Arising from Algebras with Few Subpowers
inferredcites →https://doi.org/10.1137/16m1079245openalex-snapshot
The Power of Sherali--Adams Relaxations for General-Valued CSPs
inferredcites →https://doi.org/10.1137/s0097539700366735openalex-snapshot
Space Complexity in Propositional Calculus
inferredcites →https://doi.org/10.1137/s0097539700376676openalex-snapshot
Classifying the Complexity of Constraints Using Finite Algebras
inferredcites →https://doi.org/10.1137/s0097539705447372openalex-snapshot
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
inferredcites →https://doi.org/10.1137/s0097539794266766openalex-snapshot
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
inferredcites →https://doi.org/10.1137/s1052623400366802openalex-snapshot
Global Optimization with Polynomials and the Problem of Moments
inferredcites →https://doi.org/10.1145/129712.129733openalex-snapshot
Exponential lower bounds for the pigeonhole principle
inferredcites →https://doi.org/10.1145/1536414.1536457openalex-snapshot
CSP gaps and reductions in the lasserre hierarchy
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/237814.237860openalex-snapshot
Using the Groebner basis algorithm to find proofs of unsatisfiability
inferredcites →https://doi.org/10.1145/2556646openalex-snapshot
Constraint Satisfaction Problems Solvable by Local Consistency Methods
inferredcites →https://doi.org/10.1145/2873054openalex-snapshot
Approximation Resistance from Pairwise-Independent Subgroups
inferredcites →https://doi.org/10.1145/509907.509988openalex-snapshot
Hard examples for bounded depth frege
inferredcites →https://doi.org/10.1287/moor.28.3.470.16391openalex-snapshot
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
inferredcites →https://doi.org/10.4230/dfu.vol7.15301.1openalex-snapshot
Polymorphisms, and How to Use Them
inferredcites →https://doi.org/10.5555/3329995.3330022openalex-snapshot
The limits of SDP relaxations for general-valued CSPs
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-60026-6_21openalex-snapshot
Nullstellensatz-Proofs for Multiplier Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_26openalex-snapshot
Algorithm Analysis Through Proof Complexity
inferred← citeshttps://doi.org/10.1007/s00037-020-00201-yopenalex-snapshot
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
inferred← citeshttps://doi.org/10.1007/s00037-023-00242-zopenalex-snapshot
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103538openalex-snapshot
Strength and limitations of Sherali-Adams and Nullstellensatz proof systems
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.10.002openalex-snapshot
Quantum advantage and CSP complexity
inferred← citeshttps://doi.org/10.1093/logcom/exab028openalex-snapshot
ℋ-Colouring Dichotomy in Proof Complexity
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00007openalex-snapshot
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
inferred← citeshttps://doi.org/10.1137/1.9781611977073.48openalex-snapshot
Promise Constraint Satisfaction and Width
inferred← citeshttps://doi.org/10.1137/23m1553273openalex-snapshot
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz
inferred← citeshttps://doi.org/10.1145/3201777openalex-snapshot
The Limits of SDP Relaxations for General-Valued CSPs
inferred← citeshttps://doi.org/10.1145/3519935.3520063openalex-snapshot
On the complexity of CSP-based ideal membership problems
inferred← citeshttps://doi.org/10.1145/3531130.3533344openalex-snapshot
On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
inferred← citeshttps://doi.org/10.1145/3661814.3662118openalex-snapshot
Quantum advantage and CSP complexity
inferred← citeshttps://doi.org/10.1613/jair.1.15075openalex-snapshot
Weighted, Circular and Semi-Algebraic Proofs
inferred← citeshttps://doi.org/10.23638/lmcs-15(1:4)2019openalex-snapshot
A Finite-Model-Theoretic View on Propositional Proof Complexity
inferred← citeshttps://doi.org/10.3233/faia200990openalex-snapshot
Chapter 7. Proof Complexity and SAT Solving
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.