On the public citation graph

Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity

0 signed · 34 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-45841-7_34openalex-snapshot
Complexity of Semi-algebraic Proofs
inferredcites →https://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
inferredcites →https://doi.org/10.1007/bf02126799openalex-snapshot
Ramanujan graphs
inferredcites →https://doi.org/10.1007/s00493-003-0020-5openalex-snapshot
Bounds on the Chv�tal Rank of Polytopes in the 0/1-Cube*
inferredcites →https://doi.org/10.1016/0012-365x(73)90167-2openalex-snapshot
Edmonds polytopes and a hierarchy of combinatorial problems
inferredcites →https://doi.org/10.1016/0024-3795(89)90476-xopenalex-snapshot
On cutting-plane proofs in combinatorial optimization
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(86)90135-0openalex-snapshot
NP is as easy as detecting unique solutions
inferredcites →https://doi.org/10.1016/s0166-218x(99)00156-0openalex-snapshot
On the Chvátal rank of polytopes in the 0/1 cube
inferredcites →https://doi.org/10.1086/202241openalex-snapshot
More on Soviet Sociology
inferredcites →https://doi.org/10.1109/ccc.2005.1openalex-snapshot
A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness
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.1109/mcg.1986.276611openalex-snapshot
25th Annual Symposium on Foundations of Computer Science
inferredcites →https://doi.org/10.1109/psct.1987.10319253openalex-snapshot
Tite Probabilistic Communication Complexity of Set Intersection (Preliminary Version)
inferredcites →https://doi.org/10.1109/sfcs.1986.15openalex-snapshot
Complexity classes in communication complexity theory
inferredcites →https://doi.org/10.1109/sfcs.1991openalex-snapshot
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
inferredcites →https://doi.org/10.1109/sfcs.1994.365747openalex-snapshot
Proceedings 35th Annual Symposium on Foundations of Computer Science
inferredcites →https://doi.org/10.1109/sfcs.2003.1238206openalex-snapshot
Rank bounds and integrality gaps for cutting planes procedures
inferredcites →https://doi.org/10.1137/0801013openalex-snapshot
Cones of Matrices and Set-Functions and 0–1 Optimization
inferredcites →https://doi.org/10.1145/146637.146684openalex-snapshot
Monotone circuits for matching require linear depth
inferredcites →https://doi.org/10.2307/2275583openalex-snapshot
Lower bounds for resolution and cutting plane proofs and monotone computations
inferredcites →https://doi.org/10.4086/toc.2006.v002a002openalex-snapshot

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11786986_29openalex-snapshot
Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_43openalex-snapshot
Languages with Bounded Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_14openalex-snapshot
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_4openalex-snapshot
Twelve Problems in Proof Complexity
inferred← citeshttps://doi.org/10.1007/s00224-013-9476-xopenalex-snapshot
Optimal Collapsing Protocol for Multiparty Pointer Jumping
inferred← citeshttps://doi.org/10.1007/s10958-007-0329-5openalex-snapshot
Lower bounds on static Lovász-Schrijver calculus proofs for Tseitin tautologies
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.03.005openalex-snapshot
Hellinger volume and number-on-the-forehead communication complexity
inferred← citeshttps://doi.org/10.1109/focs.2007.30openalex-snapshot
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
inferred← citeshttps://doi.org/10.1109/focs.2007.34openalex-snapshot
One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications
inferred← citeshttps://doi.org/10.1145/3357713.3384245openalex-snapshot
Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?
inferred← citeshttps://doi.org/10.2178/bsl/1203350879openalex-snapshot
The Complexity of Propositional Proofs
inferred← citeshttps://doi.org/10.7282/t3bv7fncopenalex-snapshot
Information theory methods in communicationcomplexity
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.