Content deleted Content added
m Maintain {{WPBS}}: 1 WikiProject template. Remove 1 deprecated parameter: field. Tag: |
Al-Quaknaa (talk | contribs) |
||
| (One intermediate revision by the same user not shown) | |||
Line 22:
The term "LP relaxation" is used in the Example section, but it is not explained until the "Algorithm" section further down the article. A reader (like myself) unfamiliar with the concept would benefit from an explanation of "LP relaxation" (and link to its page) in the first instance it is used. Perhaps the content could be reorganized or rewritten? [[User:Zor Quatre|Zor Quatre]] ([[User talk:Zor Quatre|talk]]) 23:14, 23 August 2023 (UTC)
== No dependence on input numbers in fixed dimension? ==
The article includes the following sentence: "Doignon's theorem asserts that an integer program is feasible whenever every subset of ''2^n'' constraints is feasible; a method combining this result with algorithms for LP-type problems can be used to solve integer programs in time that is linear in ''m'' and fixed-parameter tractable (FPT) in ''n'', but possibly doubly exponential in ''n'', '''with no dependence on ''V''.'''" (emphasis in the end mine)
I'm skeptical of this, and I couldn't find exactly this statement in the cited reference. If I'm wrong, the reference should contain a pointer to a specific statement. Why I think the claim does not hold: computing the gcd can be encoded as an ILP in 2 variables, and computing the gcd in any reasonable model takes non-constant number of operations (https://dl.acm.org/doi/abs/10.1145/103516.103522). So, what is meant here? [[User:Al-Quaknaa|Martin Koutecký]] ([[User talk:Al-Quaknaa|talk]]) 12:24, 27 April 2025 (UTC)
| |||