Please use this identifier to cite or link to this item: http://rguir.inflibnet.ac.in:8080/jspui/handle/123456789/14448
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMaurer, Stephen B-
dc.contributor.authorRalston, Anthony-
dc.date.accessioned2022-12-19T10:05:57Z-
dc.date.available2022-12-19T10:05:57Z-
dc.date.issued2005-
dc.identifier.isbn978-1-4398-6375-6-
dc.identifier.urihttp://rguir.inflibnet.ac.in:8080/jspui/handle/123456789/14448-
dc.language.isoenen_US
dc.publisherCRC Press / Taylor & Francis Groupen_US
dc.subjectDiscrete Algorithmic Mathematicsen_US
dc.subjectMathematical Preliminariesen_US
dc.subjectAlgorithmsen_US
dc.subjectMathematical Inductionen_US
dc.subjectGraphs and Treesen_US
dc.subjectFundamental Counting Methodsen_US
dc.subjectDifference Equationsen_US
dc.subjectProbabilityen_US
dc.subjectAn Introduction to Mathematical Logicen_US
dc.subjectComing Full Circle with Biology and Minimax Theoremsen_US
dc.titleDiscrete Algorithmic Mathematicsen_US
dc.typeBooken_US
Appears in Collections:Mathematics

Files in This Item:
File Description SizeFormat 
Discrete Algorithmic Mathematics.pdf
  Restricted Access
11.19 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.