a computational proof of complexity of some restricted counting problems
| Data(s) |
2009
|
|---|---|
| Resumo |
South Central University |
| Identificador | |
| Idioma(s) |
英语 |
| Publicador |
Germany Germany |
| Fonte |
Cai Jin-Yi;Lu Pinyan;Xia Mingji.a computational proof of complexity of some restricted counting problems.见：.Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),Germany,2009,138-149 |
| Palavras-Chave | #Algebra |
| Tipo |
会议论文 |
