{"paper":{"title":"On Lower Bound Methods for Tree-like Cutting Plane Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Daniel Apon","submitted_at":"2013-01-05T03:10:49Z","abstract_excerpt":"In the book Boolean Function Complexity by Stasys Jukna, two lower bound techniques for Tree-like Cutting Plane proofs (henceforth, \"Tree-CP proofs\") using Karchmer-Widgerson type communication games (henceforth, \"KW games\") are presented: The first, applicable to Tree-CP proofs with bounded coefficients, translates Omega(t) deterministic lower bounds on KW games to 2^Omega(t/log n) lower bounds on Tree-CP proof size. The second, applicable to Tree-CP proofs with unbounded coefficients, translates Omega(t) randomized lower bounds on KW games to 2^Omega(t/log^2 n) lower bounds on Tree-CP proof "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0862","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}