Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Computational Complexity of Counting and Sampling

by Istvan Miklos
Save 35% Save 35%
Current price ₹8,101.00
Original price ₹12,463.00
Original price ₹12,463.00
Original price ₹12,463.00
(-35%)
₹8,101.00
Current price ₹8,101.00

Ships in 1-2 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9781138035577
  • Binding: Paperback
  • Subject: N/A
  • Publisher: CRC Press
  • Publisher Imprint: CRC Press
  • Publication Date:
  • Pages: 300
  • Original Price: GBP 94.99
  • Language: English
  • Edition: N/A
  • Item Weight: 567 grams
  • BISAC Subject(s): Arithmetic and Combinatorics

Computational Complexity of Counting and Sampling provides readers with comprehensive and detailed coverage of the subject of computational complexity. It is primarily geared toward researchers in enumerative combinatorics, discrete mathematics, and theoretical computer science.

The book covers the following topics: Counting and sampling problems that are solvable in polynomial running time, including holographic algorithms; #P-complete counting problems; and approximation algorithms for counting and sampling.

First, it opens with the basics, such as the theoretical computer science background and dynamic programming algorithms. Later, the book expands its scope to focus on advanced topics, like stochastic approximations of counting discrete mathematical objects and holographic algorithms. After finishing the book, readers will agree that the subject is well covered, as the book starts with the basics and gradually explores the more complex aspects of the topic.

Features:

  • Each chapter includes exercises and solutions
  • Ideally written for researchers and scientists
  • Covers all aspects of the topic, beginning with a solid introduction, before shifting to computational complexity's more advanced features, with a focus on counting and sampling

István Miklós is a Hungarian mathematician and bioinformatician at the Rényi Institute in Budapest. He holds a Ph.D. from Eotvos University in Budapest. His research interests lie in theoretical and applied computer science and combinatorics, particularly in the study of Markov chain, Monte Carlo methods and in sampling and counting combinatorial objects appearing in applied mathematics. He has more than 50 peer-reviewed scientific papers.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us