Open AccessCutting-plane proofs in polynomial space
Author(s) -
William J. Cook
Publication year - 1990
Publication title -
mathematical programming
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.358
H-Index - 131
eISSN - 1436-4646
pISSN - 0025-5610
DOI - 10.1007/bf01580849
Subject(s) - mathematical proof , mathematics , polynomial , plane (geometry) , space (punctuation) , workspace , cutting plane method , calculus (dental) , mathematical analysis , geometry , algorithm , computer science , medicine , dentistry , operating system , integer programming , artificial intelligence , robot
Following Chvátal, cutting planes may be viewed as a proof system for establishing that a given system of linear inequalities has no integral solution. We show that such proofs may be carried out in polynomial workspace.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom