JOURNAL ARTICLE

Lower bounds for cutting planes proofs with small coefficients

Abstract

Article Free Access Share on Lower bounds for cutting planes proofs with small coefficients Authors: Maria Bonet Department of Mathematics, University of Pennsylvania Department of Mathematics, University of PennsylvaniaView Profile , Toniann Pitassi Mathematics and Computer Science, University of Pittsburgh Mathematics and Computer Science, University of PittsburghView Profile , Ran Raz Department of Applied Math, Weizmann Institute Department of Applied Math, Weizmann InstituteView Profile Authors Info & Claims STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computingMay 1995Pages 575–584https://doi.org/10.1145/225058.225275Published:29 May 1995Publication History 20citation356DownloadsMetricsTotal Citations20Total Downloads356Last 12 Months25Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Publisher SiteeReaderPDF

Keywords:
Mathematical proof Citation Computer science Mathematics Library science Geometry

Metrics

56
Cited By
4.54
FWCI (Field Weighted Citation Impact)
17
Refs
0.95
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Complexity and Algorithms in Graphs
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Computational Geometry and Mesh Generation
Physical Sciences →  Computer Science →  Computer Graphics and Computer-Aided Design
graph theory and CDMA systems
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

JOURNAL ARTICLE

Lower bounds for cutting planes proofs with small coefficients

Marı́a Luisa BonetToniann PitassiRan Raz

Journal:   Journal of Symbolic Logic Year: 1997 Vol: 62 (3)Pages: 708-728
JOURNAL ARTICLE

On semantic cutting planes with very small coefficients

Massimo LauriaNeil Thapen

Journal:   Information Processing Letters Year: 2018 Vol: 136 Pages: 70-75
JOURNAL ARTICLE

A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem

Massimo Lauria

Journal:   ACM Transactions on Computation Theory Year: 2016 Vol: 8 (4)Pages: 1-13
BOOK-CHAPTER

A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem

Massimo Lauria

Lecture notes in computer science Year: 2013 Pages: 351-364
© 2026 ScienceGate Book Chapters — All rights reserved.