Texts in Computational Complexity: A proof of the #P-completeness of the permanent
Type: article
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W7099568168
