"Computational complexity." . . "Data links." . . "Combinatorial analysis." . . "Network flows." . . "Computer architecture." . . "Matrices(mathematics)" . . "Random access computer storage." . . "Combinatorial analysis Data processing." . . . . "Computer programming." . . "Theoretical mathematics." . . "Mathematical models." . . "Computer programming and software." . . "Computer hardware." . . "Linear programming." . . "Algorithms." . . "STANFORD UNIV CA Dept. of COMPUTER SCIENCE." . . "Nodes." . . "Recent developments in the complexity of combinatorial algorithms"@en . "Recent developments in the complexity of combinatorial algorithms" . . . . . . . . . . . . . . "Recent Developments in the Complexity of Combinatorial Algorithms"@en . "Recent Developments in the Complexity of Combinatorial Algorithms" . . . . "Several major advances in the area of combinatorial algorithms include improved algorithms for matrix multiplication and maximum network flow, a polynomial-time algorithm for linear programming, and steps toward a polynomial-time algorithm for graph isomorphism. This paper surveys these results and suggests directions for future research. Included is a discussion of recent work by the author and his students on dynamic dictionaries, network flow problems, and related questions."@en . . . . . . . . . . . . . . . . . . .