Complexity dichotomies for counting problems /

By:

Contributor(s):

Material type: Text

TextPublication details: Cambridge Cambridge University Press 2017Description: V.1ISBN:

Subject(s):

DDC classification:

Incomplete contents:

volume 1. Boolean domain

Tags from this library: No tags from this library for this title. Log in to add tags.

Holdings
Item type	Current library	Home library	Call number	Status	Date due	Barcode
Book	Campus Library Kariavattom Processing Center	Campus Library Kariavattom	511.352 CAI.C (Browse shelf(Opens below))	Available		UCL28259

Previous		No cover image available No cover image available	No cover image available No cover image available			No cover image available No cover image available	No cover image available No cover image available	Next
Previous	511.33 NET.I Introduction to inverse problems with applications	511.34 BAL.M Model theory and the philosophy of mathematical practice	511.35 KEC.O Ordinal definability and recursion theory: The cabal seminar. V.3	511.352 CAI.C Complexity dichotomies for counting problems /	511.352 CAI.C Cpmplexity dichotomies for counting problems	511.352 SOA.T Turing computability: Theory and applications	511.352 WHI.C Computational mathematics	Next

volume 1. Boolean domain

There are no comments on this title.

to post a comment.