Universal Relations and #P-Completeness

DOI10.1007/11758471_35zbMath1183.68299OpenAlexW1586230313MaRDI QIDQ3434571

Guillaume Malod, Hervé Fournier

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758471_35

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Universal Relations and #P-Completeness