Work

Texts in Computational Complexity: A proof of the #P-completeness of the permanent

Type: article
Language: English
Open Access status: closed
OpenAlex ID: W7099568168
Cites:
Cited by: 1
Related to: 10