DocumentCode
2202375
Title
Some related problems from network flows, game theory and integer programming
Author
Sahni, Sartaj
fYear
1972
fDate
25-27 Oct. 1972
Firstpage
130
Lastpage
138
Abstract
We consider several important problems for which no polynomially time bounded algorithm is known. These problems are shown to be related in that a polynomial algorithm for one implies a polynomial algorithm for the others.
Keywords
Calculus; Computational modeling; Computer science; Game theory; Linear programming; Polynomials; Quadratic programming; Turing machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching and Automata Theory, 1972., IEEE Conference Record of 13th Annual Symposium on
Conference_Location
USA
ISSN
0272-4847
Type
conf
DOI
10.1109/SWAT.1972.23
Filename
4569705
Link To Document