a computational proof of complexity of some restricted counting problems

Autoria(s): Jin-Yi Cai; Mingji Xia; Pinyan Lu
Data(s)

2010
Identificador

http://ir.iscas.ac.cn/handle/311060/9648

http://www.irgrid.ac.cn/handle/1471x/143515
Idioma(s)

英语
Fonte

Jin-Yi Cai;Pinyan Lu;Mingji Xia.a computational proof of complexity of some restricted counting problems,Theoretical Computer Science,2010,():-
Palavras-Chave #Holographic reduction #Holant problem
Tipo

期刊论文
Acesso ao item digital