On the public citation graph

The cutting plane proof system with bounded degree of falsity

https://doi.org/10.1007/bfb0023762
0 signed · 26 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.1007/3-540-54487-9_59openalex-snapshot
Cutting plane versus frege proof systems
inferredcites →https://doi.org/10.1007/978-3-642-86718-7openalex-snapshot
First-Order Logic
inferredcites →https://doi.org/10.1007/bf01874387openalex-snapshot
Probabilistic methods in graph theory
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/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1109/sct.1990.113967openalex-snapshot
Bounded arithmetic and computational complexity
inferredcites →https://doi.org/10.1109/sfcs.1988.21951openalex-snapshot
The complexity of the pigeonhole principle
inferredcites →https://doi.org/10.1145/7531.8928openalex-snapshot
Hard examples for resolution
inferredcites →https://doi.org/10.2307/2273702openalex-snapshot
The relative efficiency of propositional proof systems
inferredcites →https://doi.org/10.2307/2273826openalex-snapshot
Polynomial size proofs of the propositional pigeonhole principle

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11499107_10openalex-snapshot
Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution
inferred← citeshttps://doi.org/10.1007/11814948_3openalex-snapshot
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_27openalex-snapshot
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_18openalex-snapshot
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_26openalex-snapshot
A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_6openalex-snapshot
On the Resolution Complexity of Graph Non-isomorphism
inferred← citeshttps://doi.org/10.1007/s00493-022-4884-7openalex-snapshot
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization — II
inferred← citeshttps://doi.org/10.1007/s10107-022-01789-5openalex-snapshot
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
inferred← citeshttps://doi.org/10.1007/s10107-022-01862-zopenalex-snapshot
Complexity of optimizing over the integers
inferred← citeshttps://doi.org/10.1109/lics.1992.185542openalex-snapshot
Cutting planes and constant depth Frege proofs
inferred← citeshttps://doi.org/10.1109/lics.1994.316069openalex-snapshot
Upper and lower bounds for tree-like cutting planes proofs
inferred← citeshttps://doi.org/10.1145/2903266openalex-snapshot
A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem
inferred← citeshttps://doi.org/10.3233/sat190062openalex-snapshot
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity12
inferred← citeshttps://doi.org/10.48550/arxiv.2011.05474openalex-snapshot
Complexity of branch-and-bound and cutting planes in mixed-integer optimization -- II
inferred← citeshttps://doi.org/10.48550/arxiv.2111.05225openalex-snapshot
Helly systems and certificates in optimization
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.