Uniqueness of integer solution of linear equations (Q601980): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Introduction to global optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniqueness of solution in linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Knapsack feasibility as an absolute value equation solvable by successive linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probability of unique integer solution to a system of linear equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5760872 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On complexity of unconstrained hyperbolic 0--1 programming problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP is as easy as detecting unique solutions / rank | |||
Normal rank |
Latest revision as of 10:18, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Uniqueness of integer solution of linear equations |
scientific article |
Statements
Uniqueness of integer solution of linear equations (English)
0 references
29 October 2010
0 references
absolute value equations
0 references
0 references