Universal relations and {\#}P-completeness
From MaRDI portal
Publication:954984
DOI10.1016/j.tcs.2008.05.003zbMath1152.68018MaRDI QIDQ954984
Hervé Fournier, Guillaume Malod
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.05.003
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Cites Work