Observations on a class of nasty linear complementarity problems (Q1141086): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Affine m-ary gray codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5564916 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4051879 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146667 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational complexity of complementary pivot methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Partition Theorem for Euclidean n-Space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3277015 / rank | |||
Normal rank |
Latest revision as of 04:19, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Observations on a class of nasty linear complementarity problems |
scientific article |
Statements
Observations on a class of nasty linear complementarity problems (English)
0 references
1980
0 references
Hamiltonian paths on n-cubes
0 references
Gray code
0 references
linear complementarity problems
0 references
binary n-vectors
0 references
basic sequences
0 references