The complexity of planar counting problems

SIAM Journal on Computing

Volumn 27, Issue 4, 1998, Pages 1142-1167

  Hunt III, Harry B ^a  

^a State University of New York   (United States)

Author keywords

p complete; 3SAT; Dp complete; Graphs; Np complete; Planar

Indexed keywords

EID: 0000376587     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793304601     Document Type: Article

References (1)

1. G. BRIGHTWELL AND P. WINKLER, Counting linear extensions is #P-complete, in Proc. 23rd Annual ACM Symposium on Theory of Computing, 1991, pp. 175-181.