"Random-Facet and Random-Bland require subexponential time even for ..."

Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick (2014)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics