Title :
Some related problems from network flows, game theory and integer programming
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;
Conference_Titel :
Switching and Automata Theory, 1972., IEEE Conference Record of 13th Annual Symposium on
Conference_Location :
USA
DOI :
10.1109/SWAT.1972.23
