{"product_id":"combinatorics-topics-techniques-algorithms","title":"Combinatorics: Topics, Techniques, Algorithms","description":"\u003cp\u003e\u003cb\u003eAuthor:\u003c\/b\u003e Cameron, Peter J.\u003c\/p\u003e\u003cp\u003e\u003cb\u003eBrand:\u003c\/b\u003e Cambridge University Press\u003c\/p\u003e\u003cp\u003e\u003cb\u003eColor:\u003c\/b\u003e Other\u003c\/p\u003e\u003cp\u003e\u003cb\u003eBinding:\u003c\/b\u003e paperback\u003c\/p\u003e\u003cp\u003e\u003cb\u003eNumber Of Pages:\u003c\/b\u003e 368\u003c\/p\u003e\u003cp\u003e\u003cb\u003eRelease Date:\u003c\/b\u003e 01-08-1994\u003c\/p\u003e\u003cp\u003e\u003cb\u003ePart Number:\u003c\/b\u003e 40 line drawings\u003c\/p\u003e\u003cp\u003e\u003cb\u003eDetails:\u003c\/b\u003e Combinatorics is a subject of increasing importance because of its links with computer science, statistics, and algebra. This textbook stresses common techniques (such as generating functions and recursive construction) that underlie the great variety of subject matter, and the fact that a constructive or algorithmic proof is more valuable than an existence proof. The author emphasizes techniques as well as topics and includes many algorithms described in simple terms. The text should provide essential background for students in all parts of discrete mathematics.\u003c\/p\u003e\u003cp\u003e\u003cb\u003eEAN:\u003c\/b\u003e 9780521457613\u003c\/p\u003e\u003cp\u003e\u003cb\u003ePackage Dimensions:\u003c\/b\u003e 9.3 x 7.5 x 0.8 inches\u003c\/p\u003e\u003cp\u003e\u003cb\u003eLanguages:\u003c\/b\u003e English\u003c\/p\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":50226690261296,"sku":"Trans_9780521457613","price":5310.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0690\/9968\/4144\/files\/61lRT0xmD0L.jpg?v=1760692584","url":"https:\/\/www.retailmaharaj.com\/bn\/products\/combinatorics-topics-techniques-algorithms","provider":"Retail Maharaj","version":"1.0","type":"link"}