Keyword : #P-completeness


Stronger Hardness Results on the Computational Complexity of Picross 3D
Kei KIMURA 
Publication:   
Publication Date: 2020/04/01
Vol. E103-A  No. 4 ; pp. 668-676
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
computational complexitypuzzlePicross 3DNP-completeness#P-completenessΣP2-completeness
 Summary | Full Text:PDF(688.3KB)

Approximate Counting Scheme for m n Contingency Tables
Shuji KIJIMA Tomomi MATSUI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2004/02/01
Vol. E87-D  No. 2 ; pp. 308-314
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
countingapproximation#P-completenessfprasMCMC methodcontingency table
 Summary | Full Text:PDF(195.1KB)