BOOK-CHAPTER
Lower bounds on sizes of cutting plane proofs for modular coloring principles
Year: 1997 DIMACS series in discrete mathematics and theoretical computer science Pages: 135-148
Keywords:
Mathematical proof Modular design Mathematics Plane (geometry) Computer science Geometry Programming language
Metrics
1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
0.50
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Manufacturing Process and Optimization
Physical Sciences → Engineering → Industrial and Manufacturing Engineering
Advanced Numerical Analysis Techniques
Physical Sciences → Engineering → Computational Mechanics
Optimization and Packing Problems
Physical Sciences → Engineering → Industrial and Manufacturing Engineering
Related Documents
JOURNAL ARTICLE
Lower bounds for resolution and cutting plane proofs and monotone computations
Journal: Journal of Symbolic Logic Year: 1997 Vol: 62 (3)Pages: 981-998
JOURNAL ARTICLE
Modular coloring formulas are hard for cutting planes proofs
Year: 1996 Pages: 595-602
JOURNAL ARTICLE
Lower bounds for cutting planes proofs with small coefficients
Marı́a Luisa BonetToniann PitassiRan Raz
Year: 1995 Pages: 575-584
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