×

Is binary encoding appropriate for the problem-language relationship? (English) Zbl 0484.68032


MSC:

68Q25 Analysis of algorithms and problem complexity
65K05 Numerical mathematical programming methods
90C05 Linear programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Even, S.; Rodeh, M., Efficient encoding of commas between strings, Comm. ACM, 21, 315-317 (1978) · Zbl 0371.94008
[2] Khachiyan, L. G., A polynomial algorithm in linear programming, Soviet Math. Dokl., 20, 191-194 (1979) · Zbl 0414.90086
[3] Megiddo, N., Towards a genuinely polynomial algorithm for linear programming, (Discussion Paper No. 493 (1981), The Center for Mathematical Studies in Economics and Management Science, Northwestern University: The Center for Mathematical Studies in Economics and Management Science, Northwestern University Evanston, IL 60201) · Zbl 0532.90061
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.