On the public citation graph

Lower bounds for a proof system with an exponential speed-up over constant-depth Frege systems and over polynomial calculus

https://doi.org/10.1007/bfb0029951
0 signed · 25 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.3240070103openalex-snapshot
An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
inferredcites →https://doi.org/10.1007/3-540-61440-0_116openalex-snapshot
Lower bounds for prepositional proofs and independence results in bounded arithmetic
inferredcites →https://doi.org/10.1007/978-3-7091-9461-4_4openalex-snapshot
A Fundamental Problem of Mathematical Logic
inferredcites →https://doi.org/10.1007/978-94-017-0487-8openalex-snapshot
Logic and Scientific Methods
inferredcites →https://doi.org/10.1007/978-94-017-0487-8_4openalex-snapshot
On Methods for Proving Lower Bounds in Propositional Logic
inferredcites →https://doi.org/10.1007/bf01200117openalex-snapshot
Exponential lower bounds for the pigeonhole principle
inferredcites →https://doi.org/10.1007/bf01294258openalex-snapshot
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
inferredcites →https://doi.org/10.1007/s000370050013openalex-snapshot
Lower bounds for the polynomial calculus
inferredcites →https://doi.org/10.1016/s0049-237x(98)80023-2openalex-snapshot
The Lengths of Proofs
inferredcites →https://doi.org/10.1017/cbo9780511529948openalex-snapshot
Bounded Arithmetic, Propositional Logic and Complexity Theory
inferredcites →https://doi.org/10.1090/dimacs/039/02openalex-snapshot
More on the relative strength of counting principles
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.1145/237814.237860openalex-snapshot
Using the Groebner basis algorithm to find proofs of unsatisfiability
inferredcites →https://doi.org/10.2307/2007638openalex-snapshot
Encyclopedia of Mathematics and its Applications.

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.2000.1726openalex-snapshot
Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_4openalex-snapshot
Twelve Problems in Proof Complexity
inferred← citeshttps://doi.org/10.1090/s0002-9939-2015-12610-xopenalex-snapshot
A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems
inferred← citeshttps://doi.org/10.1093/logcom/exab028openalex-snapshot
ℋ-Colouring Dichotomy in Proof Complexity
inferred← citeshttps://doi.org/10.1134/s1054661824010206openalex-snapshot
A Hierarchy of Determinative Sequent Systems with Different Substitution Rules
inferred← citeshttps://doi.org/10.1145/301250.301399openalex-snapshot
Linear gaps between degrees for the polynomial calculus modulo distinct primes
inferred← citeshttps://doi.org/10.1145/3243126openalex-snapshot
Some Subsystems of Constant-Depth Frege with Parity
inferred← citeshttps://doi.org/10.1145/3357713.3384288openalex-snapshot
(Semi)Algebraic proofs over {±1} variables
inferred← citeshttps://doi.org/10.1145/3506702openalex-snapshot
On Proof Complexity of Resolution over Polynomial Calculus
inferred← citeshttps://doi.org/10.1215/ijm/1258138254openalex-snapshot
On the degree of ideal membership proofs from uniform families of polynomials over a finite field
inferred← citeshttps://doi.org/10.4007/annals.2015.181.2.1openalex-snapshot
Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution
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.