i mean, a list of #p complete problems? 还要哪里可以看到NP-complete问题的列表?
f*a
2 楼
Hi Folks, Does someone know a book on optimization or estimation over complex domain? The books I have in hand carry out the analysis in the real domain only. However, the problem I am working on uses phasor/cplx nmber. I am from time to time confused on the use of transpose and conjugate transpose. Thank you.
np-hard problem list: Garey & Johnson's book or http://www.nada.kth.se/~viggo/problemlist/compendium.html the enumeration version of NPC problem is #P complete, and there are a few others, like compute permenant, the number of perfect matchings etc...
【在 t*s 的大作中提到】 : i mean, a list of #p complete problems? : 还要哪里可以看到NP-complete问题的列表?
t*s
13 楼
thanks very much
【在 l******e 的大作中提到】 : np-hard problem list: : Garey & Johnson's book : or : http://www.nada.kth.se/~viggo/problemlist/compendium.html : the enumeration version of NPC problem is #P complete, : and there are a few others, like compute permenant, the number of perfect : matchings etc...