|
![]() |
|||
|
||||
OverviewUsing a traditional deductive approach, this book looks into the fundamental ideas in discrete mathematics, including graph theory, combinatorics, number theory, coding theory, combinatorial optimization and abstract algebra. It can be approached by anyone with basic competence in arithmetic and experience of simple algebraic manipulations and students of computer science whose curriculum may now allow the study of many ancillary mathematics courses. The main changes to this new edition are to present descriptions of numerous algorithms on a form close to that of a real programming language. The aim is to enable students to develop practical programs from the design of algorithms. Full Product DetailsAuthor: Norman L. Biggs (, Professor of Mathematics, London School of Economics, University of London)Publisher: Oxford University Press Imprint: Clarendon Press Edition: 2nd Revised edition Dimensions: Width: 15.00cm , Height: 3.00cm , Length: 23.00cm Weight: 0.711kg ISBN: 9780198534273ISBN 10: 0198534272 Pages: 494 Publication Date: 01 January 1990 Audience: College/higher education , Professional and scholarly , Tertiary & Higher Education , Postgraduate, Research & Scholarly Format: Paperback Publisher's Status: Active Availability: To order ![]() Stock availability from the supplier is unknown. We will order it for you and ship this item to you once it is received by us. Table of ContentsReviewsAuthor InformationNorman L. Biggs is Professor of Mathematics, London School of Economics, University of London Tab Content 6Author Website:Countries AvailableAll regions |