"Algorithms." . . "Machine theory." . . "Computer Programming and Software." . . "Efficiency." . . . . "Theoretical Mathematics." . . . "Complexity of combinatorial algorithms"@en . "Complexity of combinatorial algorithms" . . "This paper examines recent work on the complexity of combinatorial algorithms, highlighting the aims of the work, the mathematical tools used, and the important results. Included are sections discussing ways to measure the complexity of an algorithm, methods for proving that certain problems are very hard to solve, tools useful in the design of good algorithms, and recent improvements in algorithms for solving ten representative problems. The final section suggests some directions for future research. (Author)."@en . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . "Complexity of Combinatorial Algorithms" . "Complexity of Combinatorial Algorithms"@en . . . . . . "Combinations." . . "Heuristic methods." . . "Computer program verification." . . "Mathematical models." . . "STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE." . . "Computer Hardware." . . "Stanford University. Computer Science Department." . . "Problem solving." . . "Random access computer storage." . . "Computer programming." . . "Decision theory." . . "Combinatorial analysis." . . "Time." . .