Universal Relations and #P-Completeness

Saved in:

Bibliographic Details
Published in:	Theoretical Computer Science Vol. 407; pp. 97 - 109
Main Authors:	Fournier, Hervé, Malod, Guillaume
Format:	Journal Article
Language:	Japanese
Published:	Springer Berlin Heidelberg 01.01.2006
Subjects:	[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC] Computational complexity Computer Science(all) Counting problems Theoretical Computer Science
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
ISSN:	0304-3975
DOI:	10.1016/j.tcs.2008.05.003