Is binary encoding appropriate for the problem-language relationship?

DOI10.1016/0304-3975(82)90043-3zbMath0484.68032OpenAlexW2033424339MaRDI QIDQ1163860

Nimrod Megiddo

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90043-3

zbMATH Keywords

compactnessarithmetic operationsbinary encodingencoding schemesKachiyan's algorithm for linear programming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (2)

Conditions for the existence of solutions of the three-dimensional planar transportation problem ⋮ 3 is more promising algorithmic parameter than 2

Cites Work

• Unnamed Item
• Towards a Genuinely Polynomial Algorithm for Linear Programming
• Economical encoding of commas between strings

This page was built for publication: Is binary encoding appropriate for the problem-language relationship?