Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 20 of 21 found articles
 
 
  The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
 
 
Title: The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
Author: Galanis, Andreas
Goldberg, Leslie Ann
Appeared in: Information and computation
Paging: Volume 251 (2016) nr. C pages 31 p.
Year: 2016
Contents:
Publisher: Elsevier Inc.
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 20 of 21 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands