This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.Coll on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. ... J.E. and J.D. ULLMAN, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Reading, MA, 1979). ... JOHNSON, D.S., The NP-completeness column: an ongoing guide (1st edition), J . Algorithms 2anbsp;...

Title | : | Algorithms and Complexity |

Author | : | Gerard Meurant |

Publisher | : | Elsevier - 2014-06-28 |

Continue