"Minimum ratio canceling is oracle polynomial for linear programming, but ..."

S. Thomas McCormick, Akiyoshi Shioura (2000)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/McCormickS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/McCormickS00
S. Thomas McCormick, Akiyoshi Shioura:
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. SODA 2000: 944-952

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.