On the public citation graph
Cutting planes, connectivity, and threshold logic
0 signed · 84 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.1006/inco.1995.1126openalex-snapshot
Cutting Plane and Frege Proofs
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-1-4419-7165-4_5openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-1-4612-3466-1_1openalex-snapshot
Parity and the Pigeonhole Principle
inferredcites →https://doi.org/10.1007/bfb0075316openalex-snapshot
Counting problems in bounded arithmetic
inferredcites →https://doi.org/10.1016/0016-0032(60)90676-1openalex-snapshot
An introduction to the theory of numbers
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/0304-3975(88)90072-2openalex-snapshot
Resolution proofs of generalized pigeonhole principles
inferredcites →https://doi.org/10.1016/s0022-0000(05)80063-7openalex-snapshot
On the complexity of the parity argument and other inefficient proofs of existence
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1093/oso/9780198536901.001.0001openalex-snapshot
Arithmetic, proof theory, and computational complexity
inferredcites →https://doi.org/10.1093/oso/9780199219858.001.0001openalex-snapshot
An Introduction To The Theory Of Numbers
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1992.185542openalex-snapshot
Cutting planes and constant depth Frege proofs
inferredcites →https://doi.org/10.1109/lics.1994.316069openalex-snapshot
Upper and lower bounds for tree-like cutting planes proofs
inferredcites →https://doi.org/10.1142/9789812796936_others05openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1145/129712.129733openalex-snapshot
Exponential lower bounds for the pigeonhole principle
inferredcites →https://doi.org/10.1145/225058.225147openalex-snapshot
The relative complexity of NP search problems
inferredcites →https://doi.org/10.1145/3618260openalex-snapshot
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
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
inferredcites →https://doi.org/10.2307/2274958openalex-snapshot
Reachability is harder for directed than for undirected finite graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_11openalex-snapshot
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
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-031-44981-9_4openalex-snapshot
Chop-SAT: A New Method for Knowledge-Based Agent Decision Making
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_5openalex-snapshot
Propositional Proof Complexity an Introduction
inferred← citeshttps://doi.org/10.1007/s00153-005-0282-2openalex-snapshot
Quantified propositional calculus and a second-order theory for NC1
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.1016/j.apal.2014.08.001openalex-snapshot
Short propositional refutations for dense random 3CNF formulas
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103552openalex-snapshot
Propositional proof systems based on maximum satisfiability
inferred← citeshttps://doi.org/10.1016/j.robot.2026.105522openalex-snapshot
GEO-SAT: A new approach for knowledge-based agent decision making
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.011openalex-snapshot
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00186-8openalex-snapshot
Tractability of Cut-free Gentzen-type propositional calculus with permutation inference II
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/focs46700.2020.00011openalex-snapshot
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity
inferred← citeshttps://doi.org/10.1109/lics.2004.1319632openalex-snapshot
VTC/sup O/: a second-order theory for TC/sup 0/
inferred← citeshttps://doi.org/10.1109/lics.2007.42openalex-snapshot
Separating DAG-Like and Tree-Like Proof Systems
inferred← citeshttps://doi.org/10.1109/lics.2012.60openalex-snapshot
Short Propositional Refutations for Dense Random 3CNF Formulas
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646114openalex-snapshot
No feasible interpolation for TC/sup 0/-Frege proofs
inferred← citeshttps://doi.org/10.1137/04061831xopenalex-snapshot
Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets
inferred← citeshttps://doi.org/10.1137/s0097539798353230openalex-snapshot
On Interpolation and Automatization for Frege Systems
inferred← citeshttps://doi.org/10.1145/3373718.3394754openalex-snapshot
The Surprising Power of Constant Depth Algebraic Proofs
inferred← citeshttps://doi.org/10.1145/3381881openalex-snapshot
Frege Systems for Quantified Boolean Logic
inferred← citeshttps://doi.org/10.1287/moor.1050.0151openalex-snapshot
Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12204openalex-snapshot
MaxSAT Resolution With the Dual Rail Encoding
inferred← citeshttps://doi.org/10.2307/2275583openalex-snapshot
Lower bounds for resolution and cutting plane proofs and monotone computations
inferred← citeshttps://doi.org/10.3233/faia200990openalex-snapshot
Chapter 7. Proof Complexity and SAT Solving
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2016.35openalex-snapshot
Semantic Versus Syntactic Cutting Planes
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
inferred← citeshttps://doi.org/10.5555/2833227.2833249openalex-snapshot
The space complexity of cutting planes refutations
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.