Products
Products
      • Total RON Comandă
      x
      Your cart is empty.
      Comandă
      Computational Complexity of Counting and Sampling

      Computational Complexity of Counting and Sampling

      0.0 / 10 ( 0 votes)
      Categories:
      History of science and overview
      Publishing Date:
      2018
      Publisher:
      Cover Type:
      Paperback
      Page Count:
      390
      Collection:
      ISBN:
      9781138035577
      Dimensions: l: 15.6cm | H: 23.5cm
      Unavailable
      Add to wishlist
      Unavailable
      Price applicable only to online purchases!
      Free Gift Wrapping!
      Free shipping over 150 RON
      You can return it in 14 days
      You got questions? Contact Us!
      Publisher's Synopsis
      "The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book will consist of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms"--
      Reviews and comments

      Nota

      de |

      There are no reviews yet for this product.
      Add a review
      You need to authenticate in order to add a review.