Mathematics for Algorithm and Systems Analysis

  • Authors:
  • Edward A. Bender;S. Gill Williamson; Mathematics

  • Affiliations:
  • -;-;-

  • Venue:
  • Mathematics for Algorithm and Systems Analysis
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Discrete mathematics is fundamental to computer science, and this up-to-date text assists undergraduates in mastering the ideas and mathematical language to address problems that arise in the field's many applications. It consists of 4 units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.