Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Is that related to #P complexity at all, the complexity class of counting the number of solutions to an NP-complete instance?


No


Why not, they sound like similar problems and the latter would motivate computer scientists to learn about sheafs as per the approach taken in OP's book which is applied/example driven.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: