Efficient search for rationals (Q1259410): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Q1223123 / rank | |||
Property / author | |||
Property / author: Christos H. Papadimitriou / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(79)90079-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1990480988 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3844775 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3259107 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The simplex algorithm with the pivot rule of maximizing criterion improvement / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4051879 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every Prime Has a Succinct Certificate / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A bad network problem for the simplex method and other minimum cost flow algorithms / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:43, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient search for rationals |
scientific article |
Statements
Efficient search for rationals (English)
0 references
1979
0 references
algorithm
0 references
positive rational fraction
0 references
linear programming problem
0 references
computationally equivalent
0 references