Computational complexity of counting and sampling / (Record no. 73092)

000 -LEADER
fixed length control field 03750cam a2200577Ii 4500
001 - CONTROL NUMBER
control field 9781315266954
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220531132507.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS
fixed length control field m o d
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 190225t20192019flu ob 000 0 eng d
040 ## - Cataloging Source
-- OCoLC-P
-- eng
-- rda
-- pn
-- OCoLC-P
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781315266954
-- (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1315266954
-- (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781351971614
-- (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1351971611
-- (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781351971591
-- (electronic bk. : Mobipocket)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 135197159X
-- (electronic bk. : Mobipocket)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781351971607
-- (electronic bk. : EPUB)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1351971603
-- (electronic bk. : EPUB)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Canceled/invalid ISBN 9781138035577
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Canceled/invalid ISBN 1138070831
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Canceled/invalid ISBN 9781138070837
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC)1088407366
Canceled/invalid control number (OCoLC)1088909438
-- (OCoLC)1089142449
-- (OCoLC)1089435126
-- (OCoLC)1089486057
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC-P)1088407366
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA267.7
072 #7 -
-- MAT
-- 000000
-- bisacsh
072 #7 -
-- MAT
-- 004000
-- bisacsh
072 #7 -
-- MAT
-- 036000
-- bisacsh
072 #7 -
-- UMB
-- bicssc
082 04 -
-- 511.3/52
-- 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Miklós, István
Titles and words associated with a name (Mathematician),
Relator term author.
245 10 - TITLE STATEMENT
Title Computational complexity of counting and sampling /
Statement of responsibility, etc. István Miklós.
264 #1 -
-- Boca Raton, FL :
-- CRC Press, Taylor & Francis Group,
-- [2019]
264 #4 -
-- ©2019
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
490 1# -
-- Discrete mathematics and its applications
505 0# -
-- Background on computational complexity -- Algebraic dynamic programming and monotone computations -- Linear algebraic algorithms. The power of subtracting -- #P-complete counting problems -- Holographic algorithms -- Methods of random generations -- Mixing of Markov chains and their applications in the theory of counting and sampling -- Approximable counting and sampling problems.
520 ## -
-- 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
588 ## -
-- OCLC-licensed vendor bibliographic record.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computational complexity.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Sampling (Statistics)
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element MATHEMATICS / General.
Source of heading or term bisacsh
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element MATHEMATICS / Arithmetic
Source of heading or term bisacsh
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element MATHEMATICS / Combinatorics
Source of heading or term bisacsh
856 40 -
-- Taylor & Francis
-- https://www.taylorfrancis.com/books/9781315266954
856 42 -
-- OCLC metadata license agreement
-- http://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf

No items available.

Technical University of Mombasa
Tom Mboya Street, Tudor 90420-80100 , Mombasa Kenya
Tel: (254)41-2492222/3 Fax: 2490571