Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
22
click to vote
ECCC
2008
favorite
Email
discuss
report
116
views
more
ECCC 2008
»
On the complexity of cutting plane proofs using split cuts
13 years 8 months ago
Download
domino.research.ibm.com
Sanjeeb Dash
Real-time Traffic
ECCC 2008
|
ECCC 2010
|
claim paper
Related Content
»
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
»
Adherence is better than adjacency computing the Riemann index using CAD
»
Finite Disjunctive Programming Characterizations for General MixedInteger Linear Programs
»
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits
»
Branch Cuts in Computer Algebra
»
Improved Lower Bounds for TreeLike Resolution over Linear Inequalities
»
On the Computational Complexity of CutReduction
»
Hardness Amplification in Proof Complexity
»
Improving the Accuracy and Efficiency of MAP Inference for Markov Logic
more »
Post Info
More Details (n/a)
Added
26 Dec 2010
Updated
26 Dec 2010
Type
Journal
Year
2008
Where
ECCC
Authors
Sanjeeb Dash
Comments
(0)
Researcher Info
ECCC 1998 Study Group
Computer Vision