Subtractive Reductions and Complete Problems for Counting Complexity Classes
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | 25th International Symposium on Mathematical Foundations of Computer Science - MFCS'2000 |
| Author | Durand, Arnaud, Hermann, Miki, Kolaitis, Phokion G. |
| Maintainer | CCSD |
| Last Updated | May 5, 2026, 10:43 (UTC) |
| Created | May 5, 2026, 10:43 (UTC) |
| Identifier | inria-00099381 |
| Language | en |
| contributor | Laboratoire d'Algorithmique Complexité et Logique (LACL) ; Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12)-Centre National de la Recherche Scientifique (CNRS) |
| creator | Durand, Arnaud |
| date | 2000-05-05T00:00:00 |
| harvest_object_id | cfff4159-654a-41a8-a093-dbd1c984a096 |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2026-01-21T00:00:00 |
| set_spec | type:COMM |