Some related problems from network flows, game theory and integer programming

Authors:
Sartaj Sahni
Affiliations:
-
Venue:
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Year:
1972

Citing 0
Cited 4

Polynomially Complete Fault Detection Problems

IEEE Transactions on Computers
Controlling the losing probability in a monotone game

Information Sciences: an International Journal
Playing monotone games to understand learning behaviors

Theoretical Computer Science
From synapses to rules

Cognitive Systems Research

Quantified Score

Hi-index	0.00

Visualization

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.